Results 71 to 80 of about 20,234 (200)
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice [PDF]
QuantumEncoding logical qubits with surface codes and performing multi-qubit logical operations with lattice surgery is one of the most promising approaches to demonstrate fault-tolerant quantum computing.
Kou Hamada +2 more
doaj +1 more source
, 2022 Lattice paths can be used to model scheduling and routing problems, and, therefore, identifying maximum sets of distinct paths is of general interest. We extend the work previously done by Gillman et al.
Yager, Eric, Engstrom, Marcus
core
The Carlitz lattice path polynomials
Discrete Mathematics, 2000 The author interprets some polynomials of Carlitz as generating functions for some natural statistics on lattice paths in \(\mathbb{R}^n\) \((n= 2,3)\) which admit diagonal moves.
openaire +2 more sources
Split lattice paths and Rogers-Ramanujan type identities: Split lattice paths and RR type identities
In this paper, an open problem posed by the second author [On $q$-series and split lattice paths, Graphs and Combinatorics, 2020] is addressed. Here, we provide combinatorial interpretations of four generalized basic series in terms of split lattice ...
Marwah, Bhanu, Goyal, Megha
core +2 more sources
Lattice path matroids: Structural properties
European Journal of Combinatorics, 2006 34 pages, 15 ...
Joseph E. Bonin, Anna de Mier
openaire +4 more sources
Lattice Paths Between Diagonal Boundaries [PDF]
The Electronic Journal of Combinatorics, 1998 A bivariate symmetric backwards recursion is of the form $d[m,n]=w_{0}(d[m-1,n]+d[m,n-1])+\omega_{1}(d[m-r_{1},n-s_{1}]+d[m-s_{1},n-r_{1}])+\dots+\omega_{k}(d[m-r_{k},n-s_{k}]+d[m-s_{k},n-r_{k}])$ where $\omega_{0},\dots\omega_{k}$ are weights, $r_{1},\dots r_{k}$ and $s_{1},\dots s_{k}$ are positive integers.
openaire +2 more sources
Applications in Enumerative Combinatorics of In finite Weighted Automata and Graphs [PDF]
Scientific Annals of Computer Science, 2014 In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +1 more source
Generalized Schröder matrices arising from enumeration of lattice paths [PDF]
, 2020 summary:We introduce a new family of generalized Schröder matrices from the Riordan arrays which are obtained by counting of the weighted lattice paths with steps $E = (1, 0)$, $ D = (1,1)$, $ N= (0,1)$, and $ D' = (1,2)$ and not going above the line $y ...
Yang, Lin +2 more
core +1 more source
Nonintersecting lattice paths on the cylinder
Seminaire Lotharingien de Combinatoire, 2003 We show how a formula concerning ``vicious walkers'' (which basically are nonintersecting lattice paths) on the cylinder given by P.J. Forrester can be proved and generalized by using the Lindström--Gessel--Viennot method, after having things set up in the right way.
openaire +4 more sources
On the h-Vector of a Lattice Path Matroid [PDF]
The Electronic Journal of Combinatorics, 2010 Stanley has conjectured that the h-vector of a matroid complex is a pure M-vector. We prove a strengthening of this conjecture for lattice path matroids by constructing a corresponding family of discrete polymatroids.
openaire +2 more sources