Publications related to Forbidden induced subposets of given height

Related publications (33)

Additive and geometric transversality of fractal sets in the integers

By juxtaposing ideas from fractal geometry and dynamical systems, Furstenberg proposed a series of conjectures in the late 1960's that explore the relationship between digit expansions with respect to multiplicatively independent bases. In this work, we in ...

2024

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

IEEE2024

Toroidal families and averages of L-functions, I

Philippe Michel

We initiate the study of certain families of L-functions attached to characters of subgroups of higher-rank tori, and of their average at the central point. In particular, we evaluate the average of the values L( 2 1 , chi a )L( 21 , chi b ) for arbitrary ...

Polish Acad Sciences Inst Mathematics-Impan2024

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Peak Value-at-Risk Estimation for Stochastic Differential Equations using Occupation Measures

Matteo Raphael Tacchi

This paper proposes an algorithm to upper-bound maximal quantile statistics of a state function over the course of a Stochastic Differential Equation (SDE) system execution. This chance-peak problem is posed as a nonconvex program aiming to maximize the Va ...

IEEE2023

Formula Normalizations in Verification

Viktor Kuncak, Simon Guilloud, Dragana Milovancevic, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2023

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

EUROPEAN MATHEMATICAL SOC-EMS2022

Neuromodulation of neocortical microcircuitry: a multi-scale framework to model the effects of cholinergic release

Cristina Colangelo

Neuromodulation of neocortical microcircuits is one of the most fascinating and mysterious aspects of brain physiology. Despite over a century of research, the neuroscientific community has yet to uncover the fundamental biological organizing principles un ...

EPFL2022

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Viktor Kuncak, Simon Guilloud

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Springer2022

The exploration process of critical Boltzmann planar maps decorated by a triangular O(n) loop model

Aleksandra Korzhenkova

In this paper we investigate pointed (q, g, n)-Boltzmann loop-decorated maps with loops traversing only inner triangular faces. Using peeling exploration Budd (2018) modified to this setting we show that its law in the non-generic critical phase can be cod ...

IMPA2022

Continuation Methods For Riemannian Optimization

Daniel Kressner, Axel Elie Joseph Séguin

Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemann ...

SIAM PUBLICATIONS2022

Mapping of Structure-Function Age-Related Connectivity Changes on Cognition Using Multimodal MRI

Dimitri Nestor Alice Van De Ville, Maria Giulia Preti

The relationship between age-related changes in brain structural connectivity (SC) and functional connectivity (FC) with cognition is not well understood. Furthermore, it is not clear whether cognition is represented via a similar spatial pattern of FC and ...

FRONTIERS MEDIA SA2022

Effective generation for foliated surfaces: Results and applications

Roberto Svaldi

We explore the birational structure and invariants of a foliated surface ( X , F ) in terms of the adjoint divisor K-F + epsilon K-X, 0 < epsilon & laquo; 1 0 . We then establish a bound on the automorphism group of an adjoint general type foliated surface ...

2022

Universal optimality of the E8 and Leech lattices and interpolation formulas

Maryna Viazovska

We prove that the E8 root lattice and the Leech lattice are universally optimal among point configurations in Euclidean spaces of dimensions eight and twenty-four, respectively. In other words, they minimize energy for every potential function that is a co ...

2022

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

Fabio Nobile, Eva Vidlicková, Yoshihito Kazashi

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

Springer2021

Positive moments for scattering amplitudes

Riccardo Rattazzi, Francesco Riva, Brando Bellazzini, Marc Riembau Saperas

We find the complete set of conditions satisfied by the forward 2 -> 2 scattering amplitude in unitary and causal theories. These are based on an infinite set of energy dependent quantities (the arcs) which are dispersively expressed as moments of a positi ...

American Physical Society2021

Norm And Trace Estimation With Random Rank-One Vectors

Daniel Kressner, Zvonimir Bujanovic

A few matrix-vector multiplications with random vectors are often sufficient to obtain reasonably good estimates for the norm of a general matrix or the trace of a symmetric positive semi-definite matrix. Several such probabilistic estimators have been pro ...

SIAM PUBLICATIONS2021

Three-Input Gates for Logic Synthesis

Giovanni De Micheli, Mathias Soeken, Heinz Riener, Eleonora Testa, Dewmini Sudara Marakkalage

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Idempotents in the endomorphism algebra of a finite lattice

Jacques Thévenaz, Serge Bouc

We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...

2022

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Daniel Kressner, Alice Cortinovis

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

2022