相关论文: New lower bounds for the number of blocks in balan…
We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…
The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…
In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…
This manuscript explores novel complexity results for the feasibility problem over $p$-order cones, extending the foundational work of Porkolab and Khachiyan. By leveraging the intrinsic structure of $p$-order cones, we derive refined…
In this paper we study an extension of the Polynomial Calculus proof system where we can introduce new variables and take a square root. We prove that an instance of the subset-sum principle, the binary value principle, requires refutations…
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…
Bishnoi conjectured that if a minimal t-fold blocking set in a projective plane of prime power order has maximal size then it is either a projective plane minus one point, the complement of a Baer subplane or a unital. In this note we prove…
We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…
We use Block's results to classify irreducible modules over the differential operator algebra $\mathbb{C}[t,t^{-1}, \frac d{dt}]$. From this classification and using "the twisting technique" we construct a lot of new irreducible modules…
We develop new methods for approximating conformal blocks as positive functions times polynomials, with applications to the numerical bootstrap. We argue that to obtain accurate bootstrap bounds, conformal block approximations should…
In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in $\mathbb{R}^d$ is covered by planks, then the total relative width of the planks is at least one. We prove a lower bound of $2/(1+\sqrt{d})$ for this…
(Block-)coordinate minimization is an iterative optimization method which in every iteration finds a global minimum of the objective over a variable or a subset of variables, while keeping the remaining variables constant. While for some…
We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…
We give a short proof of a slightly weaker version of the multilinear Kakeya inequality proven by Bennett, Carbery, and Tao.
Let $b_{n,k}$ denote the number of hooks of length $k$ in all the $t$-regular partitions of $n$. Singh and Barman raised the question of finding the relation between $b_{t,2}(n)$ and $b_{t,1}(n)$. Kim showed that there exists $N$ such that…
We consider a variant of the ABC Conjecture, attempting to count the number of solutions to $A+B+C=0$, in relatively prime integers $A,B,C$ each of absolute value less than $N$ with $r(A)<|A|^a, r(B)<|B|^b, r(C)<|C|^c.$ The ABC Conjecture…
Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field…
A frequently encountered problem in peer review systems is to facilitate pairwise comparisons of a given set of proposals by as few as referees as possible. In [8], it was shown that, if each referee is assigned to review k proposals then…
A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…
We construct a geodesic net in the plane with four boundary (unbalanced) vertices that has 25 balanced vertices and that is irreducible, i.e. it does not contain nontrivial subnets. This net is novel and remarkable for several reasons: (1)…