Related papers: Combinatorial Characterizations of K-matrices

Let K be the face ring of the independence complex of a matroid. We show that if T is a generic linear system of parameters, then K/T satisfies a weak form of the Hard Lefschetz Theorem. As a result, the first half of the h-vector of the…

We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…

The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First…

In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…

Connection matrices are one of the central tools in Conley's approach to the study of dynamical systems, as they provide information on the existence of connecting orbits in Morse decompositions. They may be considered a generalisation of…

We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…

This paper solves the following problem about Hermitian matrices related to the theory of $2$-structures:\emph{ }Let $n$ be a positive integer and $k$ be an integer with $k\in \{3,\ldots,n-3\}$. Characterize the Hermitian matrices $A$ such…

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…

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

We express notions of K-stability of polarized spherical varieties in terms of combinatorial data, vastly generalizing the case of toric varieties. We then provide a combinatorial sufficient condition of G-uniform K-stability by studying…

We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…

We give a combinatorial characterization of minimally rigid planar frameworks with orientation-preserving crystallographic symmetry, under the constraint of forced symmetry. The main theorems are proved by extending the methods of the first…

Kasteleyn counted the number of domino tilings of a rectangle by considering a mutation of the adjacency matrix: a Kasteleyn matrix K. In this paper we present a generalization of Kasteleyn matrices and a combinatorial interpretation for…

This paper examines a common extension of k-medoids and k-median clustering in the case of a two-dimensional Pareto front, as generated by bi-objective optimization approaches. A characterization of optimal clusters is provided, which…

The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…

We study a system of equations on a compact complex manifold, that couples the scalar curvature of a Kaehler metric with a spectral function of a first-order deformation of the complex structure. The system comes from an…

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence…

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…