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

A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

In this paper we study the inefficiency ratio of stable equilibria in load balancing games introduced by Asadpour and Saberi [3]. We prove tighter lower and upper bounds of 7/6 and 4/3, respectively. This improves over the best known bounds…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

This paper studies codes that correct bursts of deletions. Namely, a code will be called a $b$-burst-deletion-correcting code if it can correct a deletion of any $b$ consecutive bits. While the lower bound on the redundancy of such codes…

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

Let $K=\{k_1,k_2,\ldots,k_r\}$ and $L=\{l_1,l_2,\ldots,l_s\}$ be disjoint subsets of $\{0,1,\ldots,p-1\}$, where $p$ is a prime and $A=\{A_1,A_2,\ldots,A_m\}$ be a family of subsets of $[n]$ such that $|A_i|\pmod{p}\in K$ for all $A_i\in A$…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…

Let ZB be the center of a p-block B of a finite group with defect group D. We show that the Loewy length LL(ZB) of ZB is bounded by $\frac{|D|}{p}+p-1$ provided D is not cyclic. If D is non-abelian, we prove the stronger bound…

We prove that if $B$ is a $p$-block with non-trivial defect group $D$ of a finite $p$-solvable group $G$, then $\ell(B) < p^r$, where $r$ is the sectional rank of $D$. We remark that there are infinitely many $p$-blocks $B$ with non-Abelian…

Irreducibilities of Verma modules over a class of Block type Lie algebras are completely determined. The approach developed in the present paper can be used to deal with non-weight modules.

Block codes are considered for improving the reliability of messages stored in a computer memory with both stuck-at defects and random errors. It is assumed that the side information about the state of the defects is available to the…

We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…

In the present paper, it is proved that all solutions are bounded for the reversible system \ddot{x}+\sum_{i=0}^{l}b_{i}(t)x^{2i+1}\dot{x}+x^{2n+1}+\sum_{i=0}^{n-1}a_{i}(t)x^{2i+1}=0, 0\leq l\leq…

Rigid graph theory is an active area with many open problems, especially regarding embeddings in $\mathbb{R}^d$ or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number…

We study fundamental block-structured integer programs called tree-fold and multi-stage IPs. Tree-fold IPs admit a constraint matrix with independent blocks linked together by few constraints in a recursive pattern; and transposing their…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…