Results 91 to 100 of about 20,234 (200)
Restricted Grassmannian permutations [PDF]
Enumerative Combinatorics and Applications, 2022 Juan B. Gil, Jessica A. Tomasko
doaj +1 more source
Crack Control in Additive Manufacturing by Leveraging Process Parameters and Lattice Design
MicromachinesThis study investigates the design of additive manufacturing for controlled crack propagation using process parameters and lattice structures. We examine two lattice types—octet-truss (OT) and diamond (DM)—fabricated via powder bed fusion with Ti-6Al-4V.
Jun Hak Lee +4 more
doaj +1 more source
On a new congruence in the Catalan triangle [PDF]
Notes on Number Theory and Discrete MathematicsFor 0≤k≤n, the number C(n,k) represents the number of all lattice paths in the plane from the point (0,0) to the point (n,k), using steps (1,0) and (0,1), that never rise above the main diagonal y = x.
Jovan Mikić
doaj +1 more source
q-Counting n-dimensional lattice paths
, 1982 n-dimensional lattice paths are enumerated by generating functions which are Gaussian multinomial coefficients in the case of unrestricted paths. Convolutions for path counts are studied which yield a q-Vandermonde convolution and a determinant of ...
Sulanke, Robert A
core +1 more source
, 1999 The focus in this thesis is on lattice paths in R2 and R3. Three ways of counting the number of lattice paths from the origin to a point inR2 and R3 are examined; the recurrence relation, the closed form expression, and the generating function.
Renninger, Kristi Dawn
core
Lattice Paths in Diagonals and Dimensions
, 2020 The Lattice Paths of Combinatorics have been used in many applications, normally under the guise of a different name, due to its versatility in surface variety and specificity of answer.
Bennett, Freya
core
Lattice path matroids: The excluded minors
Journal of Combinatorial Theory, Series B, 2010 13 pages, 2 ...
openaire +3 more sources
Matchings avoiding partial patterns and lattice paths
, 2008 In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (0, 2) to (2n, 0).
Sherry H. F. Yan +3 more
core
Constrained Underdiagonal Paths and Pattern Avoiding Permutations
MathematicsMoving from a simple bijection P between permutations Sn of length n and underdiagonal paths of size n, The we study and enumerate families of underdiagonal paths which are defined by restricting the bijection P to subclasses of Sn avoiding some vincular
Andrea Frosini +2 more
doaj +1 more source