English
Related papers

Related papers: Irrational mixed decomposition and sharp fewnomial…

200 papers

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Algebraic Geometry · Mathematics 2009-05-29 Frederic Bihan , Frank Sottile

We continue our study of intermediate sums over polyhedra, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006),…

Combinatorics · Mathematics 2016-03-09 Velleda Baldoni , Nicole Berline , Jesús A. De Loera , Matthias Köppe , Michèle Vergne

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

Number Theory · Mathematics 2025-12-11 Neil Kolekar

Let $(W,S)$ be a Coxeter system and write $P_W(q)$ for its Poincar\'e series. Lusztig has shown that the quotient $P_W(q^2)/P_W(q)$ is equal to a certain power series $L_{W}(q)$, defined by specializing one variable in the generating…

Combinatorics · Mathematics 2016-09-05 Eric Marberg , Graham White

Let $p$ be an idempotent ultrafilter over $\mathbb{N}$. For a positive integer $N$, let ${\cal P}_{\leq N}$ denote the additive group of polynomials $P\in\mathbb{Z}[x]$ with ${\rm deg}\, P\leq N$ and $P(0)=0$. Given a unitary operator $U$…

Dynamical Systems · Mathematics 2014-01-31 Vitaly Bergelson , Stanisław Kasjan , Mariusz Lemańczyk

In the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1^{a_1},...,y_n^{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve…

Commutative Algebra · Mathematics 2011-10-05 Enrico Carlini , Maria Virginia Catalisano , Anthony V. Geramita

Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas

The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…

High Energy Physics - Theory · Physics 2007-05-23 N. L. Khviengia

We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems which depends on n, the dimension of the affine span of the…

Algebraic Geometry · Mathematics 2007-05-23 F. Bihan

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

Combinatorics · Mathematics 2025-08-26 Be'eri Greenfeld , Carlos Gustavo Moreira , Efim Zelmanov

We study an algorithm for approximating the multivariate independence polynomial $Z(\mathbf{z})$, with negative and complex arguments, an object that has strong connections to combinatorics and to statistical physics. In particular, the…

Data Structures and Algorithms · Computer Science 2017-11-15 Nicholas J. A. Harvey , Piyush Srivastava , Jan Vondrák

Subset sum is a very old and fundamental problem in theoretical computer science. In this problem, $n$ items with weights $w_1, w_2, w_3, \ldots, w_n$ are given as input and the goal is to find out if there is a subset of them whose weights…

Data Structures and Algorithms · Computer Science 2022-09-13 Hamed Saleh , Saeed Seddighin

Here, for $W$ the Coxeter group $\mathrm{D}_n$ where $n > 4$, it is proved that the maximal rank of an abstract regular polytope for $W$ is $n - 1$ if $n$ is even and $n$ if $n$ is odd. Further it is shown that $W$ has abstract regular…

Group Theory · Mathematics 2026-02-27 Malcolm Hoong Wai Chen , Peter Rowley

The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…

Mathematical Physics · Physics 2007-05-23 P. J. Forrester , N. S. Witte

We study some numerical methods for solving second order elliptic problem with interface. We introduce an immersed interface finite element method based on the `broken' $P_1$-nonconforming piecewise linear polynomials on interface…

Numerical Analysis · Mathematics 2009-11-26 Do Y. Kwak , K. T. Wee

We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…

Metric Geometry · Mathematics 2025-09-29 Polina Barabanshchikova , Grigory Ivanov , Alexander Polyanskii

Consider the optimization problem $p_{\min, Q} := \min_{\mathbf{x} \in Q} p(\mathbf{x})$, where $p$ is a degree $m$ multivariate polynomial and $Q := [0, 1]^n$ is the hypercube. We provide explicit degree and error bounds for the sums of…

Optimization and Control · Mathematics 2014-04-25 Victor Magron

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

Probability · Mathematics 2019-04-02 Jens Grygierek

The motivic nearby fiber is an invariant obtained from degenerating a complex variety over a disc. It specializes to the Euler characteristic of the original variety but also contains information on the variation of Hodge structure…

Algebraic Geometry · Mathematics 2021-10-05 Eric Katz , Alan Stapledon

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany , Sébastien Tavenas