Related papers: Combinatorics of factorization systems on lattices

In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…

We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…

We extend the notion of a factorization system in a category to the realm of $\infty$-categories. To this end, we provide a description of the category of $\infty$-categories with factorization systems as the category of presheaves of…

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…

Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…

We apply a new bosonization technique to relativistic field theories of fermions whose partition function is dominated by bosonic composites, and derive the effective action for these bosons. The derivation respects all symmetries,…

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…

It is well known that the Lorenz system has $Z_2$-symmetry. Using introducted in math.DS/0105147 topological covering-coloring a new representation for the Lorenz system is obtained. Deleting coloring leads to the factorized Lorenz system…

The Fock space of a system of indistinguishable particles is isomorphic (in a non-unique way) to the state-space of a composite i.e., many-modes, quantum system. One can then discuss quantum entanglement for fermionic as well as bosonic…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…