Related papers: Combinatorics of factorization systems on lattices
The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
We investigate the rich combinatorial structure of premodel structures on finite lattices whose weak equivalences are closed under composition. We prove that there is a natural refinement of the inclusion order of weak factorization systems…
In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
We analyse the vector bundle moduli arising from generic heterotic compactifications from the point of view of quiver representations. Phenomena such as stability walls, crossing between chambers of supersymmetry, splitting of non-Abelian…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work.…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
We study algebraic and arithmetic properties of submonoids (resp. subrings) of factorial monoids (resp. factorial domains) whose non-invertible elements all lie in the conductor. This continues earlier work of Baeth, Cisto, et al.. On our…
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
This paper establishes a rigorous connection between circuit representations and tensor factorizations, two seemingly distinct yet fundamentally related areas. By connecting these fields, we highlight a series of opportunities that can…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
We present a comprehensive and self-contained discussion of the use of the transfer matrix to study propagation in one-dimensional lossless systems, including a variety of examples, such as superlattices, photonic crystals, and optical…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…