English
Related papers

Related papers: Unlinking Theorem for Symmetric Quasi-convex Polyn…

200 papers

For $p \in \mathbb{Q}_+ \smallsetminus \{ 1 \}$ a positive rational number different from one, we say that the Puisseux series $f \in \mathbb{C}((t))^\text{alg}$ is $p$-Mahler of non-exceptional polynomial type if there is a polynomial $P…

Number Theory · Mathematics 2022-03-11 Alice Medvedev , Khoa Dang Nguyen , Thomas Scanlon

Answering a question of Simonovits and S\' os, Conlon, Fox, and Sudakov proved that for any nonempty graph $H$, and any $\varepsilon>0$, there exists $\delta>0$ polynomial in $\varepsilon$, such that if $G$ is an $n$-vertex graph with the…

Combinatorics · Mathematics 2018-11-28 Xiaoyu He

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

Algebraic Geometry · Mathematics 2013-05-28 Eric Edo , Arno van den Essen

We prove that twisting any quasi-alternating link $L$ with no gaps in its Jones polynomial $V_L(t)$ at the crossing where it is quasi-alternating produces a link $L^{*}$ with no gaps in its Jones polynomial $V_{L^*}(t)$. This leads us to…

Geometric Topology · Mathematics 2018-10-30 Nafaa Chbili , Khaled Qazaqzeh

An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…

Discrete Mathematics · Computer Science 2011-05-12 Vadim E. Levit , Eugen Mandrescu

We prove that, for any jointly stable random variables $X_1, \dots, X_k$ with zero mean, any $m<k,$ and any even continuous positive definite functions $f$ and $g$ on $\Bbb R^m$ and $\Bbb R^{k-m},$ the random variables $f(X_1,\dots,X_m)$…

Functional Analysis · Mathematics 2016-09-06 Alexander Koldobsky , Stephen J. Montgomery-Smith

Two polynomials $f, g \in \mathbb{F}[x_1, \ldots, x_n]$ are called shift-equivalent if there exists a vector $(a_1, \ldots, a_n) \in \mathbb{F}^n$ such that the polynomial identity $f(x_1+a_1, \ldots, x_n+a_n) \equiv g(x_1,\ldots,x_n)$…

Computational Complexity · Computer Science 2014-02-20 Zeev Dvir , Rafael Oliveira , Amir Shpilka

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Algebraic Geometry · Mathematics 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…

Combinatorics · Mathematics 2024-01-30 M. Klazar

Suppose X is a random vector, that is distributed uniformly in some n-dimensional convex set. It was conjectured that when the dimension n is very large, there exists a non-zero vector u, such that the distribution of the real random…

Metric Geometry · Mathematics 2009-11-11 B. Klartag

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…

Combinatorics · Mathematics 2024-12-24 Fern Gossow

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

Number Theory · Mathematics 2017-02-01 Stéphane Fischler , Tanguy Rivoal

Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we…

Combinatorics · Mathematics 2023-04-12 Nicholas A. Loehr , Gregory S. Warrington

Let $K$ be a compact subset of a totally-real manifold $M$, where $M$ is either a $\mathcal{C}^2$-smooth graph in $\mathbb{C}^{2n}$ over $\mathbb{C}^n$, or $M=u^{-1}\{0\}$ for a $\mathcal{C}^2$-smooth submersion $u$ from $\mathbb{C}^n$ to…

Complex Variables · Mathematics 2015-04-28 Sushil Gorai

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…

Functional Analysis · Mathematics 2015-01-27 J. William Helton , J. E. Pascoe , Ryan Tully-Doyle , Victor Vinnikov

We classify the pairs of polynomials $f,g \in \mathbb{C}[X]$ having orbits satisfying infinitely many multiplicative dependence relations, extending a result of Ghioca, Tucker and Zieve. Moreover, we show that given $f_1,\ldots, f_n$ from a…

Number Theory · Mathematics 2024-02-22 Marley Young

We examine three probabilistic formulations of the sentence a and b are totally unrelated with respect to a given set of variables U. First, two variables a and b are totally independent if they are independent given any value of any subset…

Artificial Intelligence · Computer Science 2015-05-19 Dan Geiger , David Heckerman

We generalize the following classical result of Fubini for pseudo-Riemannian metrics: if three essentially different metrics on $M^{n\ge 3}$ share the same unparametrized geodesics, and two of them (say, $g$ and $\bar g$) are strictly…

Differential Geometry · Mathematics 2011-08-08 Alexey V. Bolsinov , Volodymyr Kiosak , Vladimir S. Matveev

Given a univariate polynomial f(x) over a ring R, we examine when we can write f(x) as g(h(x)) where g and h are polynomials of degree at least 2. We answer two questions of Gusic regarding when the existence of such g and h over an…

Commutative Algebra · Mathematics 2013-01-23 Brian Wyman , Michael Zieve