中文
相关论文

相关论文: The asymptotic leading term for maximum rank of te…

200 篇论文

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

数论 · 数学 2025-01-10 Dan Ismailescu , Yunkyu James Lee

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

组合数学 · 数学 2025-07-16 Boris Bukh , Aleksandre Saatashvili

We give an explicit formula for the Waring rank of every binary binomial form with complex coefficients. We give several examples to illustrate this, and compare the Waring rank and the real Waring rank for binary binomial forms.

交换代数 · 数学 2021-10-13 Laura Brustenga i Moncusí , Shreedevi K. Masuti

For an $n$-variate order-$d$ tensor $A$, define $ A_{\max} := \sup_{\| x \|_2 = 1} \langle A , x^{\otimes d} \rangle$ to be the maximum value taken by the tensor on the unit sphere. It is known that for a random tensor with i.i.d $\pm 1$…

计算复杂性 · 计算机科学 2017-06-20 Vijay Bhattiprolu , Venkatesan Guruswami , Euiwoong Lee

We prove that, for every integer $d$ with $d\geq 3$, there is an approximation algorithm for the maximum induced matching problem restricted to $\{ C_3,C_5\}$-free $d$-regular graphs with performance ratio $0.708\bar{3}d+0.425$, which…

组合数学 · 数学 2015-07-16 Dieter Rautenbach

We define a matroid invariant called the three-cosystole that is related to higher notions of cogirth for weighted matroids, and we prove an optimal upper bound for it in the class of regular matroids of rank at most six. To accomplish…

组合数学 · 数学 2026-05-21 James Dylan Douthitt , Elana Israel , Lee Kennard

Let $P$ be a probability distribution on $\mathbb{R}^d$ (equipped with an Euclidean norm $|\cdot|$). Let $ r> 0 $ and let $(\alpha_n)_{n \geq1}$ be an (asymptotically) $L^r(P)$-optimal sequence of $n$-quantizers. We investigate the…

概率论 · 数学 2012-03-20 Gilles Pagès , Abass Sagna

Fix positive integers d;m such that $(m^2+4m+6)/6 \leq d < (m^2+4m+6)/3$ (the so-called Range A for space curves). Let G(d;m) be the maximal genus of a smooth and connected curve, of degree d, $C \subset P^3$ such that $h^0(I_C(m-1)) = 0$.…

代数几何 · 数学 2020-10-28 Edoardo Ballico , Philippe Ellia

Given closed possibly nonorientable surfaces $M,N$, we prove that if a map $f:M\to N$ has degree $d>0$, then $\chi(M)\le d\cdot\chi(N)$. We give all necessary comments on the definition and properties of geometric degree, which can be…

几何拓扑 · 数学 2024-04-17 Andrey Ryabichev

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

代数几何 · 数学 2022-02-15 Alessandra Bernardi , Reynaldo Staffolani

We study the sum-of-squares (SOS) rank of simple and diagonal biquadratic forms. For simple biquadratic forms in $3 \times 3$ variables, we show that the maximum SOS rank is exactly $6$, attained by a specific six-term form. We further…

最优化与控制 · 数学 2026-02-05 Yi Xu , Chufeng Cui , Liqun Qi

A W-state is an order d symmetric tensor of the form W_d=x^{d-1}y. We prove that the partially symmetric rank of W_{d_1}\otimes \cdots \otimes W_{d_k} is at most 2^{k-1}(d_1+\cdots +d_k-2k+2). The same bound holds for the tensor rank and it…

代数几何 · 数学 2025-12-08 S. Canino , A. Casarotti , P. Santarsiero

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

组合数学 · 数学 2026-02-24 Peter Frankl , Hongliang Lu , Jie Ma , Yuze Wu

This paper studies Bernstein--Sato polynomials $b_{f,0}$ for homogeneous polynomials $f$ of degree $d$ with $n$ variables. It is open to know when $-{n\over d}$ is a root of $b_{f,0}$. For essential indecomposable hyperplane arrangements,…

代数几何 · 数学 2026-01-21 Baiting Xie , Chenglong Yu

We provide an algorithm to classify the asymptotic sets of the dominant polynomial mappings $F: \C^3 \to \C^3$ of degree 2, using the definition of the so-called "{\it fa\c{c}ons}" in \cite{Thuy}. We obtain a classification theorem for the…

代数几何 · 数学 2023-05-16 Nguyen Thi Bich Thuy

Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Assume that $v_p(f(n))\ge s_1$ and $v_p(g(n))\ge s_2$ hold for all integers $n$ for some $s_1, s_2$ fixed non-negative integers. Let $S$ denote…

数论 · 数学 2021-11-12 Kristof Szabo

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

数论 · 数学 2007-05-23 László Tóth , Eduard Wirsing

The classical Remez inequality bounds the maximum of the absolute value of a polynomial $P(x)$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z$ of positive measure in $[-1,1]$. Similarly, in several…

经典分析与常微分方程 · 数学 2009-11-11 Y. Yomdin

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

组合数学 · 数学 2022-08-09 Miklós Bóna , Boris Pittel

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

组合数学 · 数学 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang