中文
相关论文

相关论文: New lower bounds for the number of blocks in balan…

200 篇论文

In this paper, we study the potential singular points of interior and boundary suitable weak solutions to the 3D Navier--Stokes equations. It is shown that upper box dimension of interior singular points and boundary singular points are…

偏微分方程分析 · 数学 2020-01-08 Yanqing Wang , Minsuk Yang

In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian group. We apply the inequalities to obtain new upper bounds for the additive energy of multiplicative subgroups and…

组合数学 · 数学 2012-11-07 I. D. Shkredov

We prove that for any non-symmetric irreducible divisible convex set, the proximal limit set is the full projective boundary.

度量几何 · 数学 2021-06-15 Pierre-Louis Blayac

Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…

群论 · 数学 2020-08-28 Nguyen Ngoc Hung , Thomas Michael Keller , Yong Yang

We provide a precise statement and self contained proof of a Sobolev inequality (cf. [A, page 236 and page 237]) stated in the original paper. Higher order and fractional inequalities are treated as well.

泛函分析 · 数学 2018-06-22 Mario Milman

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

最优化与控制 · 数学 2015-03-24 Mehdi Ghasemi , Murray Marshall

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

组合数学 · 数学 2025-12-10 Guillermo Pineda-Villavicencio , Aholiab Tritama , Jie Wang , David Yost

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

We prove new upper bounds for the length of laws that hold for all groups of size at most $n$ -- improving on previous results of Bou-Rabee and Kassabov-Matucci. The methods make use of the classification of finite simple groups. Stronger…

群论 · 数学 2015-09-08 Andreas Thom

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

信息论 · 计算机科学 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

We show new upper and lower bounds for the complexity of implementation of a sequence of Boolean matrices proposed by Kaski et al. (arXiv:1208.0554) with additive circuits.

数据结构与算法 · 计算机科学 2012-09-11 Igor Sergeev

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

数论 · 数学 2025-12-04 Anders Mah

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…

逻辑 · 数学 2024-11-08 Juan Pablo Aguilera , Thibaut Kouptchinsky

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

交换代数 · 数学 2019-10-29 Adam Boocher , Derrick Wigglesworth

Let $F(x, y)$ be a binary form with integer coefficients, degree $n\geq 3$ and irreducible over the rationals. Suppose that only $s + 1$ of the $n + 1$ coefficients of $F$ are nonzero. We show that the Thue inequality $|F(x,y)|\leq m$ has…

数论 · 数学 2020-08-26 Paloma Bengoechea

In this paper we associate to each multivariate polynomial $f$ that is homogeneous relative to a subset of its variables a series of polynomial families $P_\lambda (f)$ of $m$-tuples of homogeneous polynomials of equal degree such that the…

计算复杂性 · 计算机科学 2017-08-03 Hông Vân Lê

Bohn, Faenza, Fiorini, Fisikopoulos, Macchia, and Pashkovich (2015) conjectured that 2-level polytopes cannot simultaneously have many vertices and many facets, namely, that the maximum of the product of the number of vertices and facets is…

组合数学 · 数学 2024-04-30 Andrey Kupavskii , Dmitry Tsarev

A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…

组合数学 · 数学 2019-09-16 Tushar D. Parulekar , Sharad S. Sane

We show that a necessary and sufficient condition for a set of $n$ one-qubit mixed states to be the reduced states of a pure $n$-qubit state is that their smaller eigenvalues should satisfy polygon inequalities: no one of them can exceed…

量子物理 · 物理学 2016-09-08 A. Higuchi , A. Sudbery , J. Szulc

We introduce the techniques of semiregular bimodules over a Lie algebra with respect to a Lie subalgebra. Using this techniques in the case of affine Lie algebras we introduce twisting functors on the categories of modules. These functors…

q-alg · 数学 2008-02-03 Sergey Arkhipov