English
Related papers

Related papers: Effective Khovanskii, Ehrhart Polytopes, and the E…

200 papers

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

Combinatorics · Mathematics 2022-08-10 Cosmin Pohoata , Dmitrii Zakharov

In this article we apply a formula for the $n$-th power of a $3\times 3$ matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer…

Number Theory · Mathematics 2019-01-04 James Mc Laughlin , B. Sury

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

Combinatorics · Mathematics 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Number Theory · Mathematics 2011-10-20 Arnaud Bodin , Mireille Car

The order polytopes arising from the finite poset were first introduced and studied by Stanley. For any positive integer $d\geq 14$, Liu and Tsuchiya proved that there exists a non-Ehrhart positive order polytope of dimension $d$. They also…

Combinatorics · Mathematics 2026-04-13 Feihu Liu , Guoce Xin , Zihao Zhang

Let $p_1, p_2,..., p_n$ be distinct primes. In 1970, Erd\H os, Herzog and Sch\"{o}nheim proved that if $\cal D$ is a set of divisors of $N=p_1^{\alpha_1}...p_n^{\alpha_n}$, $\alpha_1\ge \alpha_2\ge...\ge \alpha_n$, no two members of the set…

Combinatorics · Mathematics 2012-05-22 Yong-Gao Chen , Cui-Ying Hu

Let $P(x)\in \mathbb{Z}[x]$ be a polynomial with at least two distinct complex roots. We prove that the number of solutions $(x_1, \dots, x_k, y_1, \dots, y_k)\in [N]^{2k}$ to the equation \[ \prod_{1\le i \le k} P(x_i) = \prod_{1\le j \le…

Number Theory · Mathematics 2024-08-19 Victor Y. Wang , Max Wenqiang Xu

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

Number Theory · Mathematics 2026-05-12 Shouqiao Wang , Davide Crapis

We solve a problem proposed by Khovanov by constructing, for any set of primes $S$, a triangulated category (in fact a stable $\infty$-category) whose Grothendieck group is $S^{-1}\mathbf{Z}$. More generally, for any exact $\infty$-category…

K-Theory and Homology · Mathematics 2020-02-19 Clark Barwick , Saul Glasman , Marc Hoyois , Denis Nardin , Jay Shah

Erd\H{o}s first showed that the number of positive integers up to $x$ which can be written as a product of two number less than $\sqrt{x}$ has zero density. Ford then found the correct order of growth of the set of all these integers. We…

Number Theory · Mathematics 2018-05-08 Patrick Meisner

A remarkable theorem due to Khovanskii asserts that for any finite subset $A$ of an abelian group, the cardinality of the $h$-fold sumset $hA$ grows like a polynomial for all sufficiently large $h$. Currently, neither the polynomial nor…

Number Theory · Mathematics 2021-12-23 Michael J. Curran , Leo Goldmakher

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

Combinatorics · Mathematics 2020-02-11 Tyrrell B. McAllister

In [Problems on polytopes, their groups, and realizations, Periodica Math. Hungarica 53 (2006) 231-255] Schulte and Weiss proposed the following problem: {\em Characterize regular polytopes of orders $2^np$ for $n$ a positive integer and…

Combinatorics · Mathematics 2024-07-16 Dong-Dong Hou , Yan-Quan Feng , Dimitri Leemans

We determine the order of magnitude of H^{(k+1)}(x,\vec{y},2\vec{y}), the number of integers up to x that are divisible by a product d_1...d_k with y_i<d_i\le 2y_i, when the numbers \log y_1,...,\log y_k have the same order of magnitude and…

Number Theory · Mathematics 2013-05-29 Dimitris Koukoulopoulos

We continue to explore cyclotomic factors in the descent set polynomial $Q_{n}(t)$, which was introduced by Chebikin, Ehrenborg, Pylyavskyy and Readdy. We obtain large classes of factors of the form $\Phi_{2s}$ or $\Phi_{4s}$ where $s$ is…

Combinatorics · Mathematics 2014-11-04 Richard Ehrenborg , N. Bradley Fox

Richard Stanley introduced the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ arising from a finite partially ordered set $P$, and showed that the Ehrhart polynomial of $\mathcal{O}(P)$ is equal to that of…

Combinatorics · Mathematics 2015-07-14 Takayuki Hibi , Kazunori Matsuda , Akiyoshi Tsuchiya

Suppose that $a$ and $d$ are positive integers with $a \geq 2$. Let $h_{a,d}(n)$ be the largest integer $t$ such that any set of $n$ points in $\mathbb{R}^d$ contains a subset of $t$ points for which all the non-zero volumes of the ${t…

Combinatorics · Mathematics 2023-10-13 David Conlon , Jacob Fox , William Gasarch , David G. Harris , Douglas Ulrich , Samuel Zbarsky

For positive integers $n$ and $k$ with $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots,n\}$, where two $k$-sets are adjacent exactly when they are disjoint. The independent sets…

Combinatorics · Mathematics 2022-06-08 József Balogh , Robert A. Krueger , Haoran Luo

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

Combinatorics · Mathematics 2024-02-28 Cosmin Pohoata , Dmitriy Zakharov

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

Combinatorics · Mathematics 2026-01-19 Bernhard Heim und Markus Neuhauser