Related papers: Codes and Supersymmetry in One Dimension
We determine all Chern numbers of smooth complex projective varieties of dimension at least four which are determined up to finite ambiguity by the underlying smooth manifold. We also give an upper bound on the dimension of the space of…
In this paper we investigate fixed-point numbers of endomorphisms on complex tori. Specifically, motivated by the asymptotic perspective that has turned out in recent years to be so fruitful in Algebraic Geometry, we study how the number of…
We define 2-calibrated structures, which are analogs of symplectic structures in odd dimensions. We show the existence of differential topological constructions compatible with the structure.
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…
We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the…
Dynamical realizations of the most general N=4 superconformal group in one dimension D(2,1;a) are reconsidered from the perspective of the R-symmetry subgroup SU(2). It is shown that any realization of the R-symmetry subalgebra in some…
A doubling covering $\U$ of a complex $n$-dimensional manifold $Y$ consists of analytic functions $\psi_j:B_1\to Y$, each function being analytically extendable, as a mapping to $Y$, to a four times larger concentric ball $B_4$. Main result…
For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…
A hypergraph is \textit{bipartite with bipartition $(A, B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number…
This paper deals with $n$-dimensional algebras, over any field, which have only trivial derivation (automorphism) and simple algebras. It is shown that the corresponding sets of algebras are not empty and, in algebraically closed field…
Let $A$ be a finite dimensional hereditary algebra over a field $k$ and $A^{(1)}$ the duplicated algebra of $A$. We first show that the global dimension of endomorphism ring of tilting modules of $A^{(1)}$ is at most 3. Then we investigate…
In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be…
A classification of (countable) direct limits of finite dimensional involution simple associative algebras over an algebraically closed field of arbitrary characteristic is obtained. This also classifies the corresponding dimension groups.…
We present a computationally efficient algorithm that can be used to generate all possible brane tilings. Brane tilings represent the largest class of superconformal theories with known AdS duals in 3+1 and also 2+1 dimensions and have…
We introduce tropical dual numbers as an extension of tropical semiring. By this innovation, one can work with honest ideals, instead of congruences, and recover the Euclidean topology on affine tropical spaces similar to Zariski's approach…
Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines. Instead of minimizing…
Constant dimension codes (CDCs) have become an important object in coding theory due to their application in random network coding. The multilevel construction is one of the most effective ways to construct constant dimension codes. The…
We introduce a new class of deep neural networks (DNNs) with multilayered tree-like architectures. The architectures are codified using numbers from the ring of integers of non-Archimdean local fields. These rings have a natural…
let f be an endomorphism of a complex projective space, of degree bigger than one. Let us call an algebraic subset exceptional for f, if its inverse image is set-theoretically equal to itself. J.-Y. Briend, S. Cantat and M. Shishikura…