中文
相关论文

相关论文: Polynomial-size vectors are enough for the unimodu…

200 篇论文

We exhibit a monotone function computable by a monotone circuit of quasipolynomial size such that any monotone circuit of polynomial depth requires exponential size. This is the first size-depth tradeoff result for monotone circuits in the…

计算复杂性 · 计算机科学 2024-11-22 Mika Göös , Gilbert Maystre , Kilian Risse , Dmitry Sokolov

We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of nonnegative distinct monomials. This bound was conjectured by John P. D'Angelo, proved in two dimensions by D'Angelo, Kos and Riehl and in three…

代数几何 · 数学 2013-12-05 Jiri Lebl , Han Peters

Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…

数值分析 · 数学 2025-10-03 Nicole Spillane , Daniel B Szyld

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

数论 · 数学 2020-11-09 M. J. Uray

We lay the geometric foundations for the study of the characteristic polynomial of tensors. For symmetric tensors of order $d \geq 3$ and dimension $2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only finitely many…

Galluccio--Loebl and Tesler showed that the perfect-matching polynomial of a graph embedded in an orientable surface of genus $g$ can be written as a linear combination of at most $4^g$ Pfaffians. We show that, in general, exponentially…

组合数学 · 数学 2026-05-21 Priyanshu Pant , Ranveer Singh

Framing triangulations of unit flow polytopes have received a great deal of recent study with rich connections to various generalizations of Catalan and Cambrian combinatorics as well as volume and h*-polynomial formulas. This story has…

组合数学 · 数学 2026-05-26 Jonah Berggren

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…

组合数学 · 数学 2017-02-15 Zhongshan Li , Fuzhen Zhang , Xiao-Dong Zhang

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

最优化与控制 · 数学 2022-12-27 Christian Bingane

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

数论 · 数学 2022-01-19 Amit Ghosh , Kenneth Ward

We define a bar construction endofunctor on the category of commutative augmented monoids $A$ of a symmetric monoidal category $\mathcal{V}$ endowed with a left adjoint monoidal functor $F:s\mathbf{Set}\to \mathcal{V}$. To do this, we need…

代数拓扑 · 数学 2017-09-21 Bruno Stonek

We estimate the number of zeros of a polynomial in $\mathbb{C}[z]$ within any small circular disc centered on the unit circle, which improves and comprehensively extends a result established by Borwein, Erd{\'e}lyi, and Littmann~\cite{BE1}…

复变函数 · 数学 2024-07-23 Mithun Kumar Das

We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…

组合数学 · 数学 2015-08-12 David Covert , Steven Senger

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

计算复杂性 · 计算机科学 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

数论 · 数学 2023-10-06 Florian Breuer , Fabien Pazuki

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger…

组合数学 · 数学 2007-05-23 Tien-Yien Li , J. Maurice Rojas , Xiaoshen Wang

This is the last part of a series of three strongly related papers in which three equivalent structures are studied: - internal categories in categories of monoids; defined in terms of pullbacks relative to a chosen class of spans - crossed…

范畴论 · 数学 2018-03-14 Gabriella Böhm

We prove a polynomial upper bound for the localization length of the Lorentz mirror model and the Manhattan model on the even cylinder. The main input is a conditional cylinder-localization theorem in the winding regime: if short-direction…

概率论 · 数学 2026-05-26 Linjun Li

It is conjectured that for fixed $A$, $r \ge 1$, and $d \ge 1$, there is a uniform bound on the size of the torsion submodule of a Drinfeld $A$-module of rank $r$ over a degree $d$ extension $L$ of the fraction field $K$ of $A$. We verify…

数论 · 数学 2016-09-06 Bjorn Poonen

In this paper we investigate the boundedness properties of bilinear multiplier operators associated with unimodular functions of the form $m(\xi,\eta)=e^{i \phi(\xi-\eta)}$. We prove that if $\phi$ is a $C^1(\mathbb R^n)$ real-valued…

经典分析与常微分方程 · 数学 2020-07-20 K. Jotsaroop , Saurabh Shrivastava
‹ 上一页 1 8 9 10 下一页 ›