Related papers: The cross-product conjecture for width two posets
We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…
Grothendieck develops the theory of pro-objects over a category $\mathsf{C}$. The fundamental property of the category $\mathsf{Pro}(\mathsf{C})$ is that there is an embedding $\mathsf{C} \overset{c}{\longrightarrow}…
We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)
The cross product frequently occurs in Physics and Engineering, since it has large applications in many contexts, e.g. for calculating angular momenta, torques, rotations, volumes etc. Though this mathematical operator is widely used, it is…
The combinatorial invariance conjecture (due independently to G. Lusztig and M. Dyer) predicts that if $[x,y]$ and $[x',y']$ are isomorphic Bruhat posets (of possibly different Coxeter systems), then the corresponding Kazhdan-Lusztig…
We discuss on some families of skew product maps on a square. For a kind of skew product maps with coupled-expanding property, we estimate Hausdorff dimension of its attractor. And we prove that there exists an ergodic measure with full…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
We prove extension theorems for several geometric properties such as asymptotic property C (APC), finite decomposition complexity (FDC), strict finite decomposition complexity (sFDC) which are weakenings of Gromov's finite asymptotic…
As a generalization of Hausdorff's extension theorem of metrics, we prove an interpolation theorem of a family of metrics defined on closed subsets of metrizable spaces. As an application, we investigate typicality of subsets of moduli…
A classical result in additive combinatorics, which is a combination of Balog-Szemer\'edi-Gowers theorem and a variant of Freiman's theorem due to Ruzsa, says that if a subset $A$ of $\mathbb{F}_p^n$ contains at least $c |A|^3$ additive…
The notion of a subproduct system, a generalization of that of a product system, is introduced. We show that there is an essentially 1 to 1 correspondence between cp-semigroups and pairs (X,T) where X is a subproduct system and T is an…
In this paper we study in details the properties of the duality product of multivectors and multiforms (used in the definition of the hyperbolic Clifford algebra of multivefors) and introduce the theory of the k multivector and l multiform…
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.
Generalized Product (GPC) Codes, an unification of Product Codes and Integrated Interleaved (II) Codes, are presented. Applications for approaches requiring local and global parities are described. The more general problem of extending…
Social decision schemes (SDSs) map the ordinal preferences of individual voters over multiple alternatives to a probability distribution over the alternatives. In order to study the axiomatic properties of SDSs, we lift preferences over…
We study almost squareness and the strong diameter two property in the setting of projective (symmetric) tensor product. We prove that almost squareness is preserved by taking projective tensor product, providing non-trivial examples of ASQ…
The BK inequality (\cite{BK85}) says that,for product measures on $\{0,1\}^n$, the probability that two increasing events $A$ and $B$ `occur disjointly' is at most the product of the two individual probabilities. The conjecture in…
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…
We introduce the key concepts of duality mappings and metric extensor. The fundamental identities involving the duality mappings are presented, and we disclose the logical equivalence between the so-called metric tensor and the metric…
An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…