English
Related papers

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

200 papers

Let $f(u)$ and $g(v)$ be two polynomials of degree $k$ and $\ell$ respectively, not both linear, which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle f(u),g(v),\\uv-vu\rangle$ be a…

Information Theory · Computer Science 2019-05-31 Swati Bhardwaj , Madhu Raka

We prove Sarnak's M\"obius disjointness conjecture for all unipotent translations on homogeneous spaces of real connected Lie groups. Namely, we show that if $G$ is any such group, $\Gamma\subset G$ a lattice, and $u\in G$ an Ad-unipotent…

Number Theory · Mathematics 2018-11-14 Ryan Peckner

We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be…

Quantum Physics · Physics 2007-08-22 M. Kleinmann , H. Kampermann , Ph. Raynal , D. Bruss

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…

Combinatorics · Mathematics 2025-12-05 Ajeeth Gunna , Michael Wheeler , Paul Zinn-Justin

If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Let $a$ be the size of a…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu

In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…

Number Theory · Mathematics 2022-03-02 Sinnou David , Noriko Hirata-Kohno , Makoto Kawashima

Let $K[X_n]$ be the commutative polynomial algebra in the variables $X_n=\{x_1,\ldots,x_n\}$ over a field $K$ of characteristic zero. A theorem from undergraduate course of algebra states that the algebra $K[X_n]^{S_n}$ of symmetric…

Rings and Algebras · Mathematics 2019-12-04 Vesselin Drensky , Sehmus Findik , Nazar Sahin Oguslu

Let $G$ be a connected nilpotent Lie group. Given probability-preserving $G$-actions $(X_i,\Sigma_i,\mu_i,u_i)$, $i=0,1,...,k$, and also polynomial maps $\phi_i:\mathbb{R}\to G$, $i=1,...,k$, we consider the trajectory of a joining…

Dynamical Systems · Mathematics 2019-02-20 Tim Austin

Let $G = (V, E)$ be a graph and $\sigma(G)$ the number of independent (vertex) sets in $G$. Then the Merrifield-Simmons conjecture states that the sign of the term $\sigma(G_{-u}) \cdot \sigma(G_{-v}) - \sigma(G) \cdot \sigma(G_{-u-v})$…

Combinatorics · Mathematics 2013-04-26 Martin Trinks

In this paper, we consider a variant of Tur\'an's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$,…

Number Theory · Mathematics 2018-08-16 Artūras Dubickas , Min Sha

In this note we extend the Gauss-Lucas theorem on the zeros of the derivative of a univariate polynomial to the case of sequences of univariate polynomials whose almost all zeros lie in a given convex bounded domain in C.

Classical Analysis and ODEs · Mathematics 2015-10-09 R. Boegvad , D. Khavinson , B. Shapiro

Gaussian universality results assert that the properties of many estimators remain unchanged when the input data are replaced by Gaussians. Such results have gained popularity in high-dimensional statistics and machine learning, as…

Probability · Mathematics 2025-12-03 Kevin Han Huang , Morgane Austern , Peter Orbanz

We prove the universal lifting theorem: for an $\alpha$-simply connected and $\alpha$-connected Lie groupoid $\gm$ with Lie algebroid $A$, the graded Lie algebra of multi-differentials on $A$ is isomorphic to that of multiplicative…

Differential Geometry · Mathematics 2007-05-23 David Iglesias Ponte , Camille Laurent-Gengoux , Ping Xu

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

Given f in Z[x_1,...,x_n], we compute the density of x in Z^n such that f(x) is squarefree, assuming the abc conjecture. Given f,g in Z[x_1,...,x_n], we compute unconditionally the density of x in Z^n such that gcd(f(x),g(x))=1. Function…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

The number of square-free integers in $x$ consecutive values of any polynomial $f$ is conjectured to be $c_fx$, where the constant $c_f$ depends only on the polynomial $f$. This has been proven for degrees less or equal to 3. Granville was…

Number Theory · Mathematics 2023-08-30 Pascal Jelinek

In a recent article (2022) we proved with L. Zaj\'i\v{c}ek that if $ G\subset\R^n $ is an unbounded open convex set that does not contain a translation of a convex cone with non-empty interior, then there exist $ f:G\to\R $ and a concave…

Classical Analysis and ODEs · Mathematics 2024-03-25 Václav Kryštof

We present an encoding of a polynomial system into vanishing and non-vanishing constraints on almost-principal minors of a symmetric, principally regular matrix, such that the solvability of the system over some field is equivalent to the…

Statistics Theory · Mathematics 2021-03-04 Tobias Boege
‹ Prev 1 3 4 5 6 7 10 Next ›