Related papers: Alternating paths of fully packed loops and invers…
The definition of the intersection number of a map with a closed manifold can be extended to the case of a closed stratified set such that the difference between dimensions of its two biggest strata is greater than $1$. The set Sigma of…
A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…
The aim of this article is to provide a simple sampling procedure to reconstruct any monotone path from its signature. For every N, we sample a lattice path of N steps with weights given by the coefficient of the corresponding word in the…
A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algorithms may…
In this work we study the acyclic orientations of graphs. We obtain an encoding of the acyclic orientations of the complete $p$-partite graph with size of its parts $n_1,n_2,\ldots,n_p$ via a vector with $p$ symbols and length…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…
Let $D$ be an oriented graph. The inversion of a set $X$ of vertices in $D$ consists in reversing the direction of all arcs with both ends in $X$. The inversion number of $D$, denoted by ${\rm inv}(D)$, is the minimum number of inversions…
We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…
Building upon the foundational work of Thomas and Williams on the modular sweep map, Garsia and Xin have developed a straightforward algorithm for the inversion of the sweep map on rational $(m,n)$-Dyck paths, where $(m,n)$ represents…
Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational…
Using an alternate description of support varieties of pairs of modules over a complete intersection, we give several new applications of such varieties, including results for support varieties of intermediate complete intersections.…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…
We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…
Let $C \subseteq [r]^m$ be a code such that any two words of $C$ have Hamming distance at least $t$. It is not difficult to see that determining a code $C$ with the maximum number of words is equivalent to finding the largest $n$ such that…
Given a Stirling permutation w, we introduce the mesa set of w as the natural generalization of the pinnacle set of a permutation. Our main results characterize admissible mesa sets and give closed enumerative formulas in terms of rational…
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…
This paper enumerates all juxtaposition classes of the form "Av($abc$) next to Av($xy$)", where $abc$ is a permutation of length three and $xy$ is a permutation of length two. We use Dyck paths decorated by sequences of points to represent…