相关论文: Multiply-refined enumeration of alternating sign m…

Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…

We give an introduction to the "stable algebra of matrices" as related to certain problems in symbolic dynamics. We consider this stable algebra (especially, shift equivalence and strong shift equivalence) for matrices over general rings as…

We consider the problem of construction of determinant formulas for the partition function of the six-vertex model with domain wall boundary conditions. In pioneering works of Korepin and Izergin a determinant formula was proposed and…

We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…

In this paper, we extend the enumerative study of planar hypermaps with an alternating boundary introduced in an earlier work of Bouttier and the second author. In that article, an explicit rational parametrization was obtained for the…

Nonlinear statistics (i.e. statistics of permanents) on the eigenvalues of invariant random matrix models are considered for the three Dyson's symmetry classes $\beta=1,2,4$. General formulas in terms of hyperdeterminants are found for…

We introduce almost supplementary difference sets (ASDS). For odd $m$, certain ASDS in ${\mathbb Z}_m$ that have amicable incidence matrices are equivalent to quaternary sequences of odd length $m$ with optimal autocorrelation. As one…

We address the question of the dependence of the bulk free energy on boundary conditions for the six vertex model. Here we compare the bulk free energy for periodic and domain wall boundary conditions. Using a determinant representation for…

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

Correlation functions and form factors in vertex models or spin chains are known to satisfy certain difference equations called the quantum Knizhnik-Zamolodchikov equations. We find similar difference equations for the case of semi-infinite…

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…

Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems. Theoretical guarantees for Alternating Minimization have been hard to come by and are still…

We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

Explainable boosting machines (EBMs) are popular "glass-box" models that learn a set of univariate functions using boosting trees. These achieve explainability through visualizations of each feature's effect. However, unlike linear model…

We present a stochastic setting for optimization problems with nonsmooth convex separable objective functions over linear equality constraints. To solve such problems, we propose a stochastic Alternating Direction Method of Multipliers…

The alternating ternary sum in an associative algebra, $abc - acb - bac + bca + cab - cba$, gives rise to the partially alternating ternary sum in an associative dialgebra with products $\dashv$ and $\vdash$ by making the argument $a$ the…

A classical problem of statistical inference is the valid specification of a model that can account for the statistical dependencies between observations when the true structure is dense, intractable, or unknown. To address this problem, a…

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…