Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 26 for “"catalan numbers"”.
-
Enumeration of the generalized Catalan numbers
The sequence of numbers given by the equation Cn=1n +12nn are widely known as the Catalan numbers, because they were first studied by Catalan. The ways to enumerate these numbers are similarly widely known and studied, as can be seen in Gould's catalog of Catalan numbers. Our objective is to find …
-
Parking Functions And Generalized Catalan Numbers
… functions. We develop a generalization to the Catalan numbers in order to count subsets of the parking functions. Later, we introduce a generalization to parking functions in the form of k-blocked parking functions, and examine their internal structure. Finally, we expand on the extension to …
-
Generalized Catalan Numbers and Some Divisibility Properties
… the divisibility properties of generalized Catalan numbers by ex- tending known results for ordinary Catalan numbers to their general case. First, I define the general Catalan numbers and provide a new derivation of a known formula. Second, I show several combinatorial representations of …
-
Combinatorial interpretations and q-analogues of the catalan numbers
<p>The Catalan numbers form one of the more frequently encountered counting sequences in combinatorics. In this thesis, the Catalan numbers are developed in the context of their roots in two historical problems; the problem of determining the number of ways in which an n-gon can be divided into …
-
Super Catalan Numbers and Fourier Summations over Finite Fields
We find an algebraic interpretation of the super Catalan numbers through polynomial summation formulas over unit circles over finite fields of odd characteristic. While traditional Fourier analysis involves Riemann integration over the unit circle in the real number plane, we will develop a purely …
-
Aspects of representation theory: τ-exceptional sequences, modular Fuss-Catalan numbers and idempotent completion of extriangulated categories
… of path algebras of Dynkin quivers. The modular Catalan numbers C(k,n), introduced in Hein & Huang (2017) count equivalence classes of parenthesizations of x0 ∗ · · · ∗ xn, where ∗ is a binary k-associative operation and k is a positive inte- ger. The classical notion of associativity coincides …
-
Control over the KKR bijection with respect to the nesting structure on rigged configurations and a CSP instance involving Motzkin numbers
… projects that this thesis covers. The Motzkin numbers are a sort of “re- laxed version” of the Catalan numbers. For example, Catalan numbers count perfect non-crossing matchings, while Motzkin numbers count not necessarily perfect non-crossing matchings. The first project deals with instances …
-
Enumeration of Lattice Paths with Restrictions
Lattice path enumeration, through the lens of Catalan numbers, plays a crucial role in combinatorics. This thesis delves into enumerations of some of the most common lattice paths – north-east paths, up-down paths, and Dyck paths – with restrictions applied. The first restriction is counting …
-
On free quasigroups and quasigroup representations
… If $S$ is the field of complex numbers, then ordinary characters provide a complete linear isomorphism invariant for finite-dimensional $S$-linear quasigroups. Over other rings, it is an open problem to determine tractably computable isomorphism invariants. The paper investigates …
-
Sign Matrix Polytopes
… certain shapes. One such shape is counted by the Catalan numbers, and the convex hull of these standard Young tableaux form a Catalan polytope. This Catalan polytope is shown to be integrally equivalent to the order polytope of the triangular poset: therefore the Ehrhart polynomial and volume can …
-
Parabolic Cataland
… such families are enumerated by generalized Catalan numbers. In this thesis, we consider the extension of this theory to parabolic quotients of Coxeter groups. We outline the history, present the basic definitions and constructions, and provide a number of conjectures and research challenges …
-
Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck
The Catalan numbers are considered to be the second most significant numbers in Combinatorics, after the binomial coefficients, because they appear frequently in various combinatorial problems. Professor R. Stanley maintains a record including more than 200 different combinatorial objects which are …
-
Higher Order Moments and Free Cumulants of Complex Wigner Matrices
… cumulants of this model are described by the Catalan numbers and the semicircle law, this constitutes part of the work done by Wigner in the 1950s. Later on, in 2020, Male, Mingo, Péché and Speicher answered this question for the second order case, these are known as the fluctuation moments. …
-
Invariants of Polynomials Modulo Frobenius Powers
Rational Catalan combinatorics connects various Catalan numbers to the representation theory of rational Cherednik algebras for Coxeter and complex reflection groups. Lewis, Reiner, and Stanton seek a theory of rational Catalan combinatorics for the general linear group over a finite field. The …
-
Polarization Operators in Superspace
… discoveries in combinatorics including the q, t-Catalan numbers and the Shuffle Theorem. The super coinvariant rings are a direct generalization of the classical coinvariant rings to one set of commuting variables and one set of anticommuting variables. N. Bergeron, Li, Machacek, Sulzgruber, and …
-
Fermionic Diagonal Coinvariants
… of $\FDR_W$ exhibits the Narayana refinement of Catalan numbers. When $W = S_n$, the symmetric group, $\FDR_{S_n} \cong R_{n,0,2}$, where $R_{n,0,2}$ is the special case of the Boson-Fermionic diagonal coinvariants with two sets of Fermionic variables. In this case, the $(i,j)$-th degree …
-
On Flow Polytopes, nu-Associahedra, and the Subdivision Algebra
… a lattice path ν, whose volume is given by the ν-Catalan numbers. It begins with a study of the ν-associahedron introduced by Ceballos, Padrol, and Sarmiento in 2019, but from the perspective of Schröder combinatorics. Some classical results for Schröder paths are extended to the ν-setting, and …
-
Σύγχρονες τεχνικές στη στεγανογραφία και τη στεγανάλυση
… extension enables us to use subsets ofFibonacci numbers, Catalan numbers, Lucas numbers and Unions of Lucassequences, for the representation of any integer ∈ [0,255].We prove that these special subsets improve the Fibonacci data hiding technics.These methods have very useful applications, in the …
Page 1 of 2