Related papers: Oriented Matroids -- Combinatorial Structures Unde…
We unify problems about the equivariant geometry of symmetric quiver representation varieties, in the finite type setting, with the corresponding problems for symmetric varieties $GL(n)/K$ where $K$ is an orthogonal or symplectic group. In…
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…
Recent years have witnessed rapid advances in graph representation learning, with the continuous embedding approach emerging as the dominant paradigm. However, such methods encounter issues regarding parameter efficiency, interpretability,…
There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model…
This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…
Let $\Gamma_g$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We introduce a combinatorial structure of "core surfaces", that represent subgroups of $\Gamma_g$. These structures are (usually)…
A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…
We show that many tame modules of the quantum toroidal $\mathfrak{gl}_2$ algebra can be explicitly constructed in a purely combinatorial way using the theory of $q$-characters. The examples include families of evaluation modules obtained…
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…
$k$-point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of $k$-point crossover generate, for all $k>1$, the same convexity as the interval function of the underlying…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
Recent breakthroughs in the study of scattering amplitudes have uncovered profound and unexpected connections with combinatorial geometry. These connections range from classical structures -- such as polytopes, matroids, and Grassmannians…
One of the celebrated results of Loop Quantum Gravity (LQG) is the discreteness of the spectrum of geometrical operators such as length, area and volume operators. This is an indication that Planck scale geometry in LQG is discontinuous…
Modern applications of algebraic topology to point cloud data analysis have motivated active investigation of combinatorial clique complexes -- high-dimensional extensions of combinatorial graphs. We show that meaningful invariants of such…
The Lagrangian geometry of matroids was introduced in [ADH20] through the construction of the conormal fan of a matroid M. We used the conormal fan to give a Lagrangian-geometric interpretation of the h-vector of the broken circuit complex…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…