Related papers: On subsets of the hypercube with prescribed Hammin…

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…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Let $n, m\ge 2$. Let $\Gamma<\text{SO}^\circ(n+1,1)$ be a Zariski dense convex cocompact subgroup and $\Lambda\subset\mathbb{S}^n$ be its limit set. Let $\rho : \Gamma \to \text{SO}^\circ(m+1,1)$ be a Zariski dense convex cocompact faithful…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

In 1990, Cvetkovi\'{c} and Rowlinson [The largest eigenvalue of a graph: a survey, Linear Multilinear Algebra 28(1-2) (1990), 3--33] conjectured that among all outerplanar graphs on $n$ vertices, $K_1\vee P_{n-1}$ attains the maximum…

Based on the theoretical neuroscience, G. Cotardo and A. Ravagnavi in \cite{CR} introduced a kind of asymmetric binary codes called combinatorial neural codes (CN codes for short), with a "matched metric" $\delta_{r}$ called asymmetric…

We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot |B| \geq 2^{1.01 n}$, and $X \in A$ and $Y \in B$ are…

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$…

In this paper we present a combinatorial proof of the Kronecker--Weber Theorem for global fields of positive characteristic. The main tools are the use of Witt vectors and their arithmetic developed by H. L. Schmid. The key result is to…

Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

We show that every $(n,d,\lambda)$-graph contains a Hamilton cycle for sufficiently large $n$, assuming that $d\geq \log^{6}n$ and $\lambda\leq cd$, where $c=\frac{1}{70000}$. This significantly improves a recent result of Glock, Correia…

The neighborhood complex $\N(G)$ of a graph $G$ were introduced by L. Lov{\'a}sz in his proof of Kneser conjecture. He proved that for any graph $G$, \begin{align} \label{abstract} \chi(G) \geq conn(\N(G))+3. \end{align} In this article we…

For a right invariant distance on a permutation space $S_n$ we give a sufficient condition for the cardinality of a ball of radius $R$ to grow polynomially in $n$ for fixed $R$. For the distance $\ell_1$ we show that for an integer $k$ the…

We show that the spacing between eigenvalues of the discrete 1D Hamiltonian with arbitrary potentials which are bounded, and with Dirichlet or Neumann Boundary Conditions is bounded away from zero. We prove an explicit lower bound, given by…

Alphatrion conjectured that it is possible to label the vertices of an $n$-dimensional hypercube with distinct positive integers such that for every Hamiltonian path $a_1, \dots, a_{2^n},$ we have $a_i + a_{i+1}$ prime for all $i.$ We prove…

We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…

We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations…

By using the Bergman representative coordinate and Calabi's diastasis, we extend a theorem of Lu to bounded pseudoconvex domains whose Bergman metric is incomplete with constant holomorphic sectional curvature. We characterize such domains…