English
Related papers

Related papers: Lattice Paths and Order-preserving Partial Transfo…

200 papers

We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…

Combinatorics · Mathematics 2018-04-17 Leonard Daus , Valeriu Beiu , Simon Cowell , Philippe Poulin

This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on…

Probability · Mathematics 2019-07-24 Emilio De Santis , Mauro Piccioni

We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we…

Combinatorics · Mathematics 2022-03-15 Juan B. Gil , Peter R. W. McNamara , Jordan O. Tirrell , Michael D. Weiner

We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…

Algebraic Topology · Mathematics 2022-03-02 Brendan Mallery , Adélie Garin , Justin Curry

Let $\mathcal{PMD}_{n}$ be the semigroup consisting of all monotone and order-decreasing partial transformations, and let $\mathcal{IMD}_{n}$ be the subsemigroup of $\mathcal{PMD}_{n}$ consisting of all injective monotone and…

Rings and Algebras · Mathematics 2026-01-26 Gonca Ayık , Hayrullah Ayık , Ilinka Dimitrova , Jörg Koppitz

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…

Combinatorics · Mathematics 2021-07-15 Sergi Elizalde

The presence of first sharp diffraction peaks in the partial structure factors is investigated in computer simulations of molten mixtures of alkali halides. An intermediate range ordering appears for the Li+ ions only, which is associated…

Materials Science · Physics 2008-10-17 M. Salanne , C. Simon , P. Turq , P. A. Madden

In this paper, we present Poisson brackets of certain classes of mappings obtained as general periodic reductions of integrable lattice equations. The Poisson brackets are derived using the so called Ostrogradsky transformation.

Exactly Solvable and Integrable Systems · Physics 2017-02-01 Dinh T. Tran , Peter H. van der Kamp , G. Reinout W. Quispel

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

Combinatorics · Mathematics 2007-05-23 Rekha Natarajan

In this paper, we establish a connection between Rogers-Ramanujan-Gordon type overpartitions to lattice paths with four kinds of unitary steps. By establishing the bijective relationship between overpartitions and lattice paths, we…

Combinatorics · Mathematics 2025-01-29 Diane Y. H. Shi

There are two bijections from unit interval orders on $n$ elements to Dyck paths from $(0,0)$ to $(n,n)$. One is to consider the pairs of incomparable elements, which form the set of boxes between some Dyck path and the diagonal. Another is…

Combinatorics · Mathematics 2022-12-26 Félix Gélinas , Adrien Segovia , Hugh Thomas

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

Fix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m,r) and that remain in the region bounded by P and Q can be identified with…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier , Marc Noy

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

Category Theory · Mathematics 2010-12-10 Pierre Gillibert

In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice…

Combinatorics · Mathematics 2013-02-14 Sen-Peng Eu , Tung-Shan Fu , Justin T. Hou , Te-Wei Hsu

We study intersections of orbits in polynomial semigroup dynamics with lines on the affine plane over a number field, extending previous work of D. Ghioca, T. Tucker, M. Zieve (2008)

Number Theory · Mathematics 2021-07-01 Jorge Mello

We consider the tree-reduced path of symmetric random walk on $\ZZ^{d}$. It is interesting to ask about the number of turns $T_n$ in the reduced path after $n$ steps. This question arises from inverting signature for lattice paths. We show…

Probability · Mathematics 2011-09-27 Yunjiang Jiang , Weijun Xu

This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a…

Programming Languages · Computer Science 2010-09-03 Michael Codish , Vitaly Lagoon , Peter J. Stuckey