相关论文: Embedding dimension gaps in sparse codes
We study supergravity models in four dimensions where the hidden sector is superconformal and strongly-coupled over several decades of energy below the Planck scale, before undergoing spontaneous breakdown of scale invariance and…
We study the entanglement in the ground state of a chain of free spinless fermions with a single side-coupled impurity. We find a logarithmic scaling for the entanglement entropy of a segment neighboring the impurity. The prefactor of the…
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…
Two new constructions are presented for coils and snakes in the hypercube. Improvements are made on the best known results for snake-in-the-box coils of dimensions 9, 10 and 11, and for some other circuit codes of dimensions between 8 and…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension…
Two new constructions of linear code pairs $C_2 \subset C_1$ are given for which the codimension and the relative minimum distances $M_1(C_1,C_2)$, $M_1(C_2^\perp,C_1^\perp)$ are good. By this we mean that for any two out of the three…
Word embeddings are a powerful natural language processing technique, but they are extremely difficult to interpret. To enable interpretable NLP models, we create vectors where each dimension is inherently interpretable. By inherently…
Neural codes serve as a language for neurons in the brain. Convex codes, which arise from the pattern of intersections of convex sets in Euclidean space, are of particular relevance to neuroscience. Not every code is convex, however, and…
A kinematic chain in three-dimensional Euclidean space consists of $n$ links that are connected by spherical joints. Such a chain is said to be within a closed configuration when its link lengths form a closed polygonal chain in three…
We examine the maximum dimension of a linear system of plane cubic curves whose $\mathbb{F}_q$-members are all geometrically irreducible. Computational evidence suggests that such a system has a maximum (projective) dimension of $3$. As a…
In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
We introduce a model of three-dimensional (3D) topological order enriched by planar subsystem symmetries. The model is constructed starting from the 3D toric code, whose ground state can be viewed as an equal-weight superposition of…
We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…
We study Fano schemes $F_k(X)$ for complete intersections $X$ in a projective toric variety $Y\subset \mathbb{P}^n$. Our strategy is to decompose $F_k(X)$ into closed subschemes based on the irreducible decomposition of $F_k(Y)$ as studied…
We explore two approaches to characterise the quantum geometry of the ground state of correlated fermions in terms of the distance matrix in the spectral parameter space. (a) An intrinsic geometry approach, in which we study the intrinsic…
A 3D floor plan is a non-overlapping arrangement of blocks within a large box. Floor planning is a central notion in chip-design, and with recent advances in 3D integrated circuits, understanding 3D floor plans has become important. In this…
Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…
We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…