Related papers: New inequalities for families without k pairwise d…
Let $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\choose m+1}+\ldots +{n\choose 2m+1}$ if $n=3m+1$. Confirming the conjecture…
We study families $\mathcal{F}\subseteq 2^{[n]}$ with restricted intersections and prove a conjecture of Snevily in a stronger form for large $n$. We also obtain stability results for Kleitman's isodiametric inequality and families with…
For integers $n\ge s\ge 2$ let $e(n,s)$ denote the maximum of $|\mathcal F|,$ where $\mathcal F$ is a family of subsets of an $n$-element set and $\mathcal F$ contains no $s$ pairwise disjoint members. Half a century ago, solving a…
We strengthen H\"older's inequality. The new family of sharp inequalities we obtain might be thought of as an analog of Pythagorean theorem for the $L^p$ spaces. Our reasonings rely upon Bellman functions of four variables.
A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most $(1+o(1))\binom{n}{n/2}$.…
Most of known multipartite Bell inequalities involve correlation functions for all subsystems. They are useless for entangled states without such correlations. We give a method of derivation of families of Bell inequalities for N parties,…
We prove a one-parameter family of sharp integral inequalities for functions on the $n$-dimensional unit ball. The inequalities are conformally invariant, and the sharp constants are attained for functions that are equivalent to a constant…
In this paper, we determine the largest family $\mathcal F \subset 2^{[n]}$ without $s$ pairwise disjoint sets, provided $n=ms+c$ for positive integers $m,c$, and $s \geq s_0(m, c)$. This result can be seen as a non-uniform analogue of the…
We present an algorithm which can generate all pairwise non-isomorphic $K_2$-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We…
This paper lays out the foundations of graded $K$-theory for Leavitt algebras associated with higher-rank graphs, also known as Kumjian-Pask algebras, establishing it as a potential tool for their classification. For a row-finite $k$-graph…
A disjoint $(v,k,k-1)$ difference family in an additive group $G$ is a partition of $G\setminus\{0\}$ into sets of size $k$ whose lists of differences cover, altogether, every non-zero element of $G$ exactly $k-1$ times. The main purpose of…
We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.
We derive families of Newton-like inequalities involving the elementary symmetric functions of sets of self-conjugate complex numbers in the right half-plane. These are the first known inequalities of this type which are independent of the…
A classical result of Kleitman determines the maximum number $f(n,s)$ of subsets in a family $\mathcal{F}\subseteq 2^{[n]}$ of sets that do not contain distinct sets $F_1,F_2,\dots,F_s$ that are pairwise disjoint in the case $n\equiv 0,-1$…
A proof of Bell's theorem without inequalities is presented in which distant local setups do not need to be aligned, since the required perfect correlations are achieved for any local rotation of the local setups.
A new class of rational parametrization has been developed and it was used to generate a new family of rational functions B-splines $\displaystyle{{\left({}^{\alpha}{\mathbf B}_{i}^{k} \right)}_{i=0}^{k}}$ which depends on an index $\alpha…
The feasibility conditions obtained in a previous report are refined, and used to determine several infinite families of feasible parameters for strongly regular graphs with no triangles. The methods are also used to improve the lower bound…
The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the…
We expand the class of linear symmetric equations for which large sets with no non-trivial solutions are known. Our idea is based on first finding a small set with no solutions and then enlarging it to arbitrary size using a…
We give new definitions for the determinant over commutative ring $K$, noncommutative ring $\mathbf{K}$, noncommutative ring $\mathcal{K}$ with associative powers, over noncommutative nonassociative ring $\mathfrak{K}$, and study their…