Related papers: An information theoretic approach to Sidorenko's c…
This article will explore the K- and L-theory of group rings and their applications to algebra, geometry and topology. The Farrell-Jones Conjecture characterizes K- and L-theory groups. It has many implications, including the Borel and…
There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical…
For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…
We conjecture a multi-parameter generalization of the toric inequalities of \cite{Czech:2023xed}. We then extend their proof methods for the generalized toric inequalities in two ways. The first extension constructs the graph corresponding…
This work proposes an algebraic model for classical information theory. We first give an algebraic model of probability theory. Information theoretic constructs are based on this model. In addition to theoretical insights provided by our…
The notion of a continuous $G$-action on a topological space readily generalizes to that of a continuous $D$-action, where $D$ is any small category. Dror Farjoun and Zabrodsky introduced a generalized notion of orbit, which is key to…
An $r$-uniform hypergraph ($r$-graph for short) is called linear if every pair of vertices belong to at most one edge. A linear $r$-graph is complete if every pair of vertices are in exactly one edge. The famous Brown-Erd\H{o}s-S\'os…
Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…
The Kneser hypergraph ${\rm KG}^r_{n,k}$ is an $r$-uniform hypergraph with vertex set consisting of all $k$-subsets of $\{1,\ldots,n\}$ and any collection of $r$ vertices forms an edge if their corresponding $k$-sets are pairwise disjoint.…
We study actions of Lie supergroups, in particular, the hitherto elusive notion of orbits through odd (or more general) points. Following categorical principles, we derive a conceptual framework for their treatment and therein prove general…
In this paper, we apply liaison theory to the Eisenbud-Green-Harris conjecture and prove that the conjecture holds for a certain subclass of homogeneous ideals in the linkage class of a complete intersection ideal. In the case of three…
We consider four long-standing Rigidity Conjectures about synchrony and phase patterns for hyperbolic periodic orbits of admissible ODEs for networks. Proofs of stronger local versions of these conjectures, published in 2010-12, are now…
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
Although G\"odel's incompleteness theorem made mathematician recognize that no axiomatic system could completely prove its correctness and that there is an eternal hole between our knowledge and the world, physicists so far continue to work…
Chernoff information upper bounds the probability of error of the optimal Bayesian decision rule for $2$-class classification problems. However, it turns out that in practice the Chernoff bound is hard to calculate or even approximate. In…
The ain of this note is to make available the unpublished proof of Scorichenko of the isomorphism between stable K-theory and functor homology for polynomial coefficients over an arbitrary ring.
Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a…
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'. We discuss the extent to which Kolmogorov's and Shannon's…
There is a remarkable connection between the maximum clique number and the Lagrangian of a graph given by T. S. Motzkin and E.G. Straus in 1965. This connection and its extensions were successfully employed in optimization to provide…