Related papers: The operator formula for monotone triangles - simp…
Alternating sign triangles (ASTs) have recently been introduced by Ayyer, Behrend and the author, and it was proven that there is the same number of ASTs with n rows as there is of nxn alternating sign matrices (ASMs). We prove a conjecture…
Triple symbols are arithmetic analogues of the mod $n$ triple linking number in topology, where $n > 1$ is an integer. In this paper, we introduce a cohomological formulation of a mod $n$ triple symbol for characters over a number field…
We show that Ore operators can be desingularized by calculating a least common left multiple with a random operator of appropriate order. Our result generalizes a classical result about apparent singularities of linear differential…
We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…
Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…
The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…
We give, for general Banach spaces, a characterization of the sequential lower limit of maximal monotone operators of type (D) and prove its representability. As a consequence, using a recent extension of the Moreau-Yosida regularization…
We suggest an axiom system for a collection of matchings that describes the triangulation of product of simplices.
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is…
In monotone classification, the input is a multi-set $P$ of points in $\mathbb{R}^d$, each associated with a hidden label from $\{-1, 1\}$. The goal is to identify a monotone function $h$, which acts as a classifier, mapping from…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
A triple of commuting operators for which the closed tetrablock $\overline{\mathbb E}$ is a spectral set is called a tetrablock contraction or an $\mathbb E$-contraction. The set $\mathbb E$ is defined as \[ \mathbb E = \{…
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…
In this paper we propose a resolvent splitting with minimal lifting for finding a zero of the sum of $n\ge 2$ maximally monotone operators involving the composition with a linear bounded operator. The resolvent of each monotone operator,…
We settle an open problem of several years standing by showing that the least-squares mean for positive definite matrices is monotone for the usual (Loewner) order. Indeed we show this is a special case of its appropriate generalization to…
We provide a simple and efficient algorithm for the projection operator for weighted $\ell_1$-norm regularization subject to a sum constraint, together with an elementary proof. The implementation of the proposed algorithm can be downloaded…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
Two-side estimates for two-weighted discrete Hardy-type operators on a tree are obtained. For general weights we prove the discrete analogue of Evans - Harris - Pick theorem (it is a quite simple consequence from their result). It gives the…
We derive formulas for $(i)$ the number of toroidal $n\times n$ binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and $(ii)$ the number of toroidal $n\times n$ binary arrays, allowing rotation and/or…
Arrowed Gelfand-Tsetlin patterns have recently been introduced to study alternating sign matrices. In this paper, we show that a $(-1)$-enumeration of arrowed Gelfand-Tsetlin patterns can be expressed by a simple product formula. The…