Related papers: On universality of regular realizability problems
In this paper, we prove the FPP conjecture, giving a strong upper bound on the unitary dual of a real reductive group. Our proof is an application of the global generation properties of $\mathcal{D}$-modules on the flag variety and their…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…
We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…
Invertible neural networks (INNs) are neural network architectures with invertibility by design. Thanks to their invertibility and the tractability of Jacobian, INNs have various machine learning applications such as probabilistic modeling,…
The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…
The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two…
Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…
The dynamics of an inviscid and incompressible fluid flow on a Riemannian manifold is governed by the Euler equations. In recent papers [5, 6, 7, 8] several unknown facets of the Euler flows have been discovered, including universality…
We introduce the notion of Bernstein-Sato polynomial of an arbitrary variety (which is not necessarily reduced nor irreducible), using the theory of V-filtrations of M. Kashiwara and B. Malgrange. We prove that the decreasing filtration by…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
In this paper we consider the solvability of a non-convex regular polynomial vector optimization problem on a nonempty closed set. We introduce regularity conditions for the polynomial vector optimization problem and study properties and…
Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…
Universality results for equivariant neural networks remain rare. Those that do exist typically hold only in restrictive settings: either they rely on regular or higher-order tensor representations, leading to impractically high-dimensional…
We face the problem of characterizing the periodic cases in parametric families of (real or complex) rational diffeomorphisms having a fixed point. Our approach relies on the Normal Form Theory, to obtain necessary conditions for the…
We construct differential algebras in which spaces of (one-dimensional) periodic ultradistributions are embedded. By proving a Schwartz impossibility type result, we show that our embeddings are optimal in the sense of being consistent with…
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…
We find upper and lower bounds of the multiplicities of irreducible admissible representations $\pi$ of a semisimple Lie group $G$ occurring in the induced representations $Ind_H^G\tau$ from irreducible representations $\tau$ of a closed…