Related papers: The poset perspective on alternating sign matrices

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

This paper presents a new combinatorial optimisation task, the Subset Sum Matching Problem (SSMP), which is an abstraction of common financial applications such as trades reconciliation. We present three algorithms, two suboptimal and one…

The PASEP (Partially Asymmetric Simple Exclusion Process) is a probabilistic model of moving particles, which is of great interest in combinatorics, since it appeared that its partition function counts some tableaux. These tableaux have…

Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…

The Alternating Direction Method of Multipliers (ADMM) provides a natural way of solving inverse problems with multiple partial differential equations (PDE) forward models and nonsmooth regularization. ADMM allows splitting these…

Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…

An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…

A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…

A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…

The Adaptive Smoothing Method (ASM) is a data-driven approach for traffic state estimation. It interpolates unobserved traffic quantities by smoothing measurements along spatio-temporal directions defined by characteristic traffic wave…

Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The…

In this paper, we introduce the rhombic alternative tableaux, whose weight generating functions provide combinatorial formulae to compute the steady state probabilities of the two-species ASEP. In the ASEP, there are two species of…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

The number of non-negative integer matrices with given row and column sums appears in a variety of problems in mathematics and statistics but no closed-form expression for it is known, so we rely on approximations of various kinds. Here we…

For reconstruction of low-rank matrices from undersampled measurements, we develop an iterative algorithm based on least-squares estimation. While the algorithm can be used for any low-rank matrix, it is also capable of exploiting a-priori…