Related papers: Duality and bicrystals on infinite binary matrices
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
We present combinatorial upper bounds on dimensions of certain imaginary root spaces for symmetric Kac-Moody algebras. These come from the realization of the corresponding infinity-crystal using quiver varieties. The framework is general,…
It was shown recently that Birkhoff's theorem for doubly stochastic matrices can be extended to unitary matrices with equal line sums whenever the dimension of the matrices is prime. We prove a generalization of the Birkhoff theorem for…
This paper has an expository nature. We compare the spectral properties (such as boundedness and compactness) of three families of semi-infinite matrices and point out similarities between them. The common feature of these families is that…
We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
We discuss Cauchy type decompositions of crystal graphs for general linear Lie superalgebras. More precisely, we consider bicrystal graph structures on various sets of matrices of non-negative integers, and obtain their decompositions with…
We introduce the notion of crystallographic T-duality, inspired by the appearance of $K$-theory with graded equivariant twists in the study of topological crystalline materials. Besides giving a range of new topological T-dualities, it also…
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…
A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…
The crystal base of the modified quantized enveloping algebras of type $A_{+\infty}$ or $A_\infty$ is realized as a set of integral bimatrices. It is obtained by describing the decomposition of the tensor product of a highest weight crystal…
We find a remarkable family of $\mathrm{G}_2$ structures defined on certain principal $\mathrm{SO}(3)$-bundles $P_\pm\longrightarrow M$ associated with any given oriented Riemannian 4-manifold $M$. Such structures are always cocalibrated.…
Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be…
We consider two quantities that measure complexity of binary strings: $\mathit{KA}(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and $\mathit{KP}(x)$ denotes prefix complexity of a binary…
We show that $J-$ stability is open and dense in natural families of meromorphic maps of one complex variable with a finite number of singular values, and even more generally, to finite type maps. This extends the results of…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven…
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs…