Related papers: Self similar sets, entropy and additive combinator…
We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…
Mixture distributions are extensively used as a modeling tool in diverse areas from machine learning to communications engineering to physics, and obtaining bounds on the entropy of probability distributions is of fundamental importance in…
We show that if a complete, doubling metric space is annularly linearly connected then its conformal dimension is greater than one, quantitatively. As a consequence, we answer a question of Bonk and Kleiner: if the boundary of a one-ended…
A novel type of approximants is introduced, being based on the ideas of self-similar approximation theory. The method is illustrated by the examples possessing the structure typical of many problems in applied mathematics. Good numerical…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
We present an intrinsic and concrete development of the subdivision of small categories, give some simple examples and derive its fundamental properties. As an application, we deduce an alternative way to compare the homotopy categories of…
Let G be an arbitrary Abelian group and let A be a finite subset of G. A has small additive doubling if |A+A| < K|A| for some K>0. These sets were studied in papers of G.A. Freiman, Y. Bilu, I. Ruzsa, M.C.--Chang, B. Green and T.Tao. In the…
In this paper, we are concerned with the relationship among the lower Assouad type dimensions. For uniformly perfect sets in doubling metric spaces, we obtain a variational result between two different but closely related lower Assouad…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We prove that finite sets of real numbers satisfying $|AA| \leq |A|^{1+\epsilon}$ with sufficiently small $\epsilon > 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can…
A relation between the conformal anomaly and the logarithmic term in the entanglement entropy is known to exist for CFT's in even dimensions. In odd dimensions the local anomaly and the logarithmic term in the entropy are absent. As was…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…
We consider the independence complexes of square grids with cylindrical boundary conditions. When one of the dimensions is small we use simple reductions induced by edge removals to show explicit natural homotopy equivalences between those…
We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be…
Mixture distributions are a workhorse model for multimodal data in information theory, signal processing, and machine learning. Yet even when each component density is simple, the differential entropy of the mixture is notoriously hard to…
Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
The geometrical theory of partial differential equations in the absolute sense, without any additional structures, is developed. In particular the symmetries need not preserve the hierarchy of independent and dependent variables. The order…
We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…