相关论文: Polynomial configurations in sets of positive uppe…

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

We present two new contributions to the study of the independence polynomial $Z_G(z)$ of a finite simple graph $G = (V,E)$. First, we provide an improved lower bound for the zero-free region of $Z_G(z)$ for the important class of claw-free…

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

If $\vf_1, ... \vf_m\colon\Z\to\Z^\ell$ are polynomials with zero constant terms and $E\subset\Z^\ell$ has positive upper Banach density, then we show that the set $E\cap (E-\vf_1(p-1))\cap\...\cap (E-\vf_m(p-1))$ is nonempty for some prime…

We investigate the properties of the inverse limit of the algebras of local unitary invariant polynomials of quantum systems containing various types of fermionic and/or bosonic particles as the dimensions of the single particle state…

Consider an absolutely irreducible polynomial $F(Y,X_1,\ldots,X_n) \in \mathbb{Z}[Y,X_1,\ldots,X_n]$ that is monic in $Y$ and is a polynomial in $Y^m$ for an integer $m \geq 1$. Let $N(F,B)$ count the number of $\mathbf{x} \in [-B,B]^n \cap…

The feasible region $\Omega_{{\rm ind}}(F)$ of a graph $F$ is the collection of points $(x,y)$ in the unit square such that there exists a sequence of graphs whose edge densities approach $x$ and whose induced $F$-densities approach $y$. A…

Let $T$ be a forest. We study polynomially high-chromatic pure pairs in graphs with no $T$ as an induced subgraph ($T$-free graphs in other words), with applications to the polynomial Gy\'arf\'as-Sumner conjecture. In addition to reproving…

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…

Let $f(x)$ and $g(x)$ be two real polynomials whose leading coefficients have the same sign. Suppose that $f(x)$ and $g(x)$ have only real zeros and that $g$ interlaces $f$ or $g$ alternates left of $f$. We show that if $ad\ge bc$ then the…

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

For a real number $q>1$ and a positive integer $m$, let $Y_m(q):={\sum_{i=0}^n\epsilon_i q^i:\; \epsilon_i\in \{0, \pm 1,..., \pm m\}, n=0, 1,...}.$ In this paper, we show that $Y_m(q)$ is dense in ${\Bbb R}$ if and only if $q<m+1$ and $q$…

In this paper, we construct explicit families of polynomials $P \in \mathbb{F}_q[x_1,\dots,x_n]$ with large root sets which have restricted intersections with affine lines. We use these sets to make substantial progress on a number of…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B…

A theorem of R\"odl states that for every fixed $F$ and $\varepsilon>0$ there is $\delta=\delta_F(\varepsilon)$ so that every induced $F$-free graph contains a vertex set of size $\delta n$ whose edge density is either at most $\varepsilon$…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

We study graphs of polynomial growth from the perspective of asymptotic geometry and descriptive set theory. The starting point of our investigation is a theorem of Krauthgamer and Lee who showed that every connected graph of polynomial…