English
Related papers

Related papers: New Lower Bounds against Homogeneous Non-Commutati…

200 papers

We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to…

Computational Complexity · Computer Science 2014-04-29 Mark Bun , Justin Thaler

We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear…

Computational Complexity · Computer Science 2009-07-16 Pavel Hrubes , Amir Yehudayoff

The dimension of a partially-ordered set $P$ is the smallest integer $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$ is bounded…

Combinatorics · Mathematics 2024-01-26 Victor Souza , Leo Versteegen

A classical problem in combinatorics seeks colorings of low discrepancy. More concretely, the goal is to color the elements of a set system so that the number of appearances of any color among the elements in each set is as balanced as…

Computer Science and Game Theory · Computer Science 2025-02-19 Ioannis Caragiannis , Kasper Green Larsen , Sudarshan Shyam

We prove better lower bounds on additive spanners and emulators, which are lossy compression schemes for undirected graphs, as well as lower bounds on shortcut sets, which reduce the diameter of directed graphs. We show that any $O(n)$-size…

Data Structures and Algorithms · Computer Science 2019-07-23 Shang-En Huang , Seth Pettie

We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval $[-1,1]$. Let $\Pi^*_n$ be the subset of polynomials of degree at most $n$ in $d$…

Optimization and Control · Mathematics 2025-09-09 Mareike Dressler , Simon Foucart , Mioara Joldes , Etienne de Klerk , Jean-Bernard Lasserre , Yuan Xu

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

Number Theory · Mathematics 2015-06-11 Karl Levy

We demonstrate the existence of a uniform and nonhomogeneous vector bundle $E$ of rank $(n-d)(m+1)-1$ over Grassmannian $\mathbb{G}(d,n)$, where $m>d$ and $1\le d \le n-d-1$ with a $\mathbb{P}$-homogeneity degree $h(E)=d$. Particularly, we…

Algebraic Geometry · Mathematics 2024-04-04 Rong Du , Yiting Wang , Dazhi Zhang

We prove that the existence of a homogeneous invariant of degree n for a representation of a semi-simple Lie group guarantees the existence of non-trivial solutions of D_{\alpha} = 0: these correspond to the maximum value of the square of…

Mathematical Physics · Physics 2007-05-23 F. Buccella

Given a family $\mathcal{B}$ of axis-parallel boxes in $\mathbb{R}^d$, let $\tau$ denote its piercing number, and $\nu$ its independence number. It is an old question whether $\tau/\nu$ can be arbitrarily large for given $d\geq 2$. Here,…

Combinatorics · Mathematics 2022-10-12 István Tomon

A Boolean function $f:\{0,1\}^d \mapsto \{0,1\}$ is unate if, along each coordinate, the function is either nondecreasing or nonincreasing. In this note, we prove that any nonadaptive, one-sided error unateness tester must make…

Computational Complexity · Computer Science 2017-06-02 Roksana Baleshzar , Deeparnab Chakrabarty , Ramesh Krishnan S. Pallavoor , Sofya Raskhodnikova , C. Seshadhri

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

Let $X$ be a minuscule homogeneous space, an odd quadric, or an adjoint homogenous space of type different from $A$ and $G_2$. Le $C$ be an elliptic curve. In this paper, we prove that for $d$ large enough, the scheme of degree $d$…

Algebraic Geometry · Mathematics 2011-05-27 Boris Pasquier , Nicolas Perrin

In this paper we study the existence of at least two positive weak solutions for an inhomogeneous fourth order equation with Navier boundary data involving nonlinearities of critical growth with a bifurcation parameter $\lambda$ in…

Analysis of PDEs · Mathematics 2015-04-14 Abhishek Sarkar

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

Fix a prime $p$ and an integer $m$ with $p> m \geq 2$. Define the family of finite groups \[ G_n :=SL_m (\mathbb{Z}/p^{n}\mathbb{Z}) \] for $n=1,2,... $. We will prove that there exist two positive constants $C$ and $d$ such that for any…

Group Theory · Mathematics 2007-05-23 Oren Dinai

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

Combinatorics · Mathematics 2025-07-24 Sauvik Poddar , Angsuman Das

In this paper, we prove that if $P$ is a homogeneous prime ideal inside a standard graded polynomial ring $S$ with $\dim(S/P)=d$, and for $s \leq d$, adjoining $s$ general linear forms to the prime ideal changes the $(d-s)$-th Hilbert…

Commutative Algebra · Mathematics 2025-01-15 Cheng Meng

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

Discrete Mathematics · Computer Science 2025-10-14 Pasin Manurangsi , Raghu Meka

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov
‹ Prev 1 3 4 5 6 7 10 Next ›