Related papers: Polytopes and large counterexamples
This paper presents a counterexample-guided iterative algorithm to compute convex, piecewise linear (polyhedral) Lyapunov functions for uncertain continuous-time linear hybrid systems. Polyhedral Lyapunov functions provide an alternative to…
We establish homotopy ribbon concordance obstructions coming from the Blanchfield form and Levine-Tristram signatures. Then, as an application of twisted Alexander polynomials, we show that for every knot K with nontrivial Alexander…
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
The Ehrhart ring of the edge polytope $\mathcal{P}_G$ for a connected simple graph $G$ is known to coincide with the edge ring of the same graph if $G$ satisfies the odd cycle condition. This paper gives for a graph which does not satisfy…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
We use the 2-loop term of the Kontsevich integral to show that there are (many) knots with trivial Alexander polynomial which don't have a Seifert surface whose genus equals the rank of the Seifert form. This is one of the first…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
This paper discusses a function that is frequently presented as a simile or look-alike of the so-called ``counterexample function to P=NP,'' that is, the function that collects all first instances of a problem in NP where a poly machine…
We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…
We exhibit several counterexamples showing that the famous Serrin's symmetry result for semilinear elliptic overdetermined problems may not hold for partially overdetermined problems, that is when both Dirichlet and Neumann boundary…
We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…
"Period collapse" refers to any situation where the period of the Ehrhart function of a polytope is less than the denominator of that polytope. We study several interesting situations where this occurs, primarily involving triangles. For…
Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…
Heap monoids equipped with Bernoulli measures are a model of probabilistic asynchronous systems. We introduce in this framework the notion of asynchronous stopping time, which is analogous to the notion of stopping time for classical…
The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…