Related papers: Sparse Paving Positroids
The scattering matrix approach is employed to determine a joint probability density function of reflection eigenvalues for chaotic cavities coupled to the outside world through both ballistic and tunnel point contacts. Derived under…
In recent years there has been a growing interest in companion matrices. There is a deep knowledge of sparse companion matrices, in particular it is known that every sparse companion matrix can be transformed into a unit lower Hessenberg…
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hypergraphs. Our method is based on a generalization of the canonical…
When modeling network data using a latent position model, it is typical to assume that the nodes' positions are independently and identically distributed. However, this assumption implies the average node degree grows linearly with the…
We introduce weighted succession rules and parametric production matrices - simple extensions of the standard ECO method succession rules and production matrices. The purpose is to enumerate combinatorial objects with respect to several…
We study lattice path matroid polytopes using their alcoved triangulation. We characterize Gorenstein lattice path matroid polytopes, yielding a new class of matroids satisfying the unimodality conjecture of de Loera, Haws, and K{\"o}ppe.…
We classify all linearly compact simple Jordan superalgebras over an algebraically closed field of characteristic zero. As a corollary, we deduce the classification of all linearly compact unital simple generalized Poisson superalgebras.
Gasharov introduced the combinatorial objects known as $P$-arrays to prove $s$-positivity for the chromatic symmetric functions of incomparability graphs of (3+1)-free posets. We define a crystal, a directed colored graph with some…
We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…
We review some properties of periodic orbit families in polygonal billiards and discuss in particular a sum rule that they obey. In addition, we provide algorithms to determine periodic orbit families and present numerical results that shed…
Multiplication of a sparse matrix with another (dense or sparse) matrix is a fundamental operation that captures the computational patterns of many data science applications, including but not limited to graph algorithms, sparsely connected…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Puiseux series including non-separable ones. The method works by transforming the polynomial and its roots into a special form and then…
In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…
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…
A positroid is the matroid of a real matrix with nonnegative maximal minors, a positroid variety is the closure of the locus of points in a complex Grassmannian whose matroid is a fixed positroid, and a positroid class is the cohomology…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
We compute the Poisson bracket relations for the monodromy matrix of the auxiliary linear problem. If the basic Poisson bracket relations of the model contain derivatives, this computation leads to a peculiar type of symmetry breaking which…
A parametrization of a positroid variety $\Pi$ of dimension $d$ is a regular map $(\mathbb{C}^{\times})^{d} \rightarrow \Pi$ which is birational onto a dense subset of $\Pi$. There are several remarkable combinatorial constructions which…