Related papers: Congruence for lattice path models with filter res…
We find a formula for the number of solutions of linear congruence systems, by using elementary methods.
We obtain lattice models whose continuum limits correspond to $N=2$ superconformal coset models. This is done by taking the well known vertex model whose continuum limit is the $G \times G/G$ conformal field theory, and twisting the…
A new realization of the conformal algebra is studied which mimics the behaviour of a statistical system on a discrete albeit infinite lattice. The two-point function is found from the requirement that it transforms covariantly under this…
For a topological space $X$, we introduce a criterion for the $\rm FI$ module $H^i({\rm Conf}_n(X))$ to be finitely generated and give several applications. For instance, if $C$ is a finite connected $CW$ complex, then $X = C \times…
In traditional logistic regression models, the link function is often assumed to be linear and continuous in predictors. Here, we consider a threshold model that all continuous features are discretized into ordinal levels, which further…
At the end of the 1960s, Knuth characterised the permutations that can be sorted using a stack in terms of forbidden patterns. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. Subsequently,…
We show how to define and count lattice points in the moduli space $\modm_{g,n}$ of genus g curves with n labeled points. This produces a polynomial with coefficients that include the Euler characteristic of the moduli space, and…
Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…
An important element of the $S$-matrix bootstrap program is the relationship between the modulus of an $S$-matrix element and its phase. Unitarity relates them by an integral equation. Even in the simplest case of elastic scattering, this…
We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.
The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that…
We study the behavior of the optimal path between two sites separated by a distance $r$ on a $d$-dimensional lattice of linear size $L$ with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a…
For composite nonsmooth optimization problems, Forward-Backward algorithm achieves model identification (e.g. support identification for the Lasso) after a finite number of iterations, provided the objective function is regular enough.…
A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…
To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating…
This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…
The availability of a reliable bound on an integral involving the square of the modulus of a form factor on the unitarity cut allows one to constrain the form factor at points inside the analyticity domain and its shape parameters, and also…
Topological order of a topological phase of matter in two spacial dimensions is encoded by a unitary modular (tensor) category (UMC). A group symmetry of the topological phase induces a group symmetry of its corresponding UMC. Gauging is a…
We study the decomposition problem for tensor powers of $B_2$-fundamental modules. To solve this problem singular weight technique and injection fan algorithms are applied. Properties of multiplicity coefficients are formulated in terms of…