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 288 for “"Discrete Mathematics and Combinatorics"”.
-
AUTOMATED CONJECTURING ON THE INDEPENDENCE NUMBER AND MINIMUM DEGREE OF DIAMETER-2-CRITICAL GRAPHS
… focusing mainly on their independence number and minimum degree. We show that there exist D2C graphs with minimum degree strictly larger than their independence number, and that this gap can be arbitrarily large. We also exhibit D2C graphs with maximum number of common neighbors strictly …
-
Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group
… for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information about the decomposition numbers. …
-
Gallai-Ramsey Number for Classes of Brooms
… $m$ representing the number of vertices on the handle and $\ell$ representing the number of bristle vertices. We develop a technique to reduce the difficulty of finding $gr_{k}(K_{3}:B_{m,\ell})$, and use the technique to prove a few cases with a fixed handle length, but arbitrarily many …
-
Homomesies and Toggleability Spaces
… us to obtain homomesies for piecewise-linear and birational rowmotion, even in the case of infinite orbits. Integral to this is a novel generalization of a result in the literature, which relaxes the conditions needed to lift a statistic. We completely describe the order ideal (resp. …
-
Irreducible Representations from Group Actions on Trees
… group $S_n$ found by acting on labeled graphs and trees with $n$ vertices. Our main results provide combinatorial interpretations that give the number of times the irreducible representations associated with the integer partitions $(n)$ and $(1^n)$ appear in the representations. We describe a …
-
Recoloring in Hereditary Graph Classes: Structure and Decomposition
… graph whose vertices are the k-colorings of G and two colorings are adjacent in Rk(G) if they differ on exactly one vertex. The basic question investigated here can be phrased as follows: Given a graph G and two k-colorings of G, can we transform one into the other by changing the color of one …
-
Community Detection Detailed for Online Social Networks
… even more powerful tool for recognize patterns and trends in a network. In this research we look build a model for Community Detection in these online social networks. We combine the ideas from both discrete mathematics and sociology, to build an algorithm with the specific intent on discovering …
-
Zero-sum magic graphs and their null sets
… numbers, a graph G=(V,E), with vertex set V and edge set E, is said to be h-magic if there exists a labeling of the edge set E, using the integer group mod h such that the induced vertex labeling, the sum of all edges incident to a vertex, is a constant map. When this constant is 0 we call G …
-
A Study of Graphical Permutations
A permutation π on a set of positive integers {a_1,a_2,...,a_n} is said to be graphical if there exists a graph containing exactly a_i vertices of degree (a_i) for each i. It has been shown that for positive integers with a_1
-
Generalizations of Pascal's Triangle: A Construction Based Approach
… the expansion of the polynomial of one variable and the multivariate case. Our goal is to establish relationships between these generalizations, and to use the properties of the generalizations to create a new type of generalization for the multivariate case that can be represented in the third …
-
On the Combinatorial Invariance for Kazhdan-Lusztig Polynomials
… The conjecture is widely suspected to be true; and there is an abun dance of computational evidence which supports it. Despite this, no complete proof has been discovered for more than forty years. We will explore some known results about the CIC, particularly those by Dyer, Incitti, Brenti, …
-
Cohen-Macaulay Type of Open Neighborhood Ideals of Unmixed Trees
Given a tree T and a field k, we define the open neighborhood ideal N(T) of T in k[V] to be the ideal generated by the open neighborhoods of all vertices in the graph. If T is unmixed with respect to the total domination problem, then it is known that N(T) is Cohen-Macaulay. Our goal is to compute …
-
Simulated Annealing Approach To Flow Shop Scheduling
… schedule to finish in a minimum span of time, and also satisfy the optimality criterion set for the related scheduling problem is NP-Hard, if n > 2. In this thesis, we have developed an algorithm adopting a heuristic called Simulated Annealing, to act as a support to the Flow Shop Scheduling. …
-
An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number
We will explore the combinatorial and geometric properties related to the Macdonald polynomials and the diagonal harmonics. We have the combinatorial Macdonald polynomial formula that ts the dening conditions directly. The shue conjecture gives an elegant expression of the Frobenius series of the …
-
Rainbow Turan Methods for Trees
… introduced in 2007 by Keevash, Mubayi, Sudakov and Verstraete. The rainbow Tur ́an number of a graph F , ex*(n, F ), is the largest number of edges for an n vertex graph G that can be properly edge colored with no rainbow F subgraph. Chapter 1 of this dissertation gives relevant definitions and …
-
Self-organized criticality in biased activated random walk
… demonstrate many of the conjectured universality and self-organized criticality (SOC) properties of the interacting particle system Activated Random Walk (ARW) in the setting of one-dimensional biased walks, as formulated for instance in Levine and Silvestri’s 2024 survey. Namely, there exists the …
-
Combinatorial Models Used In Representation Theory
We consider the use of combinatorics to solve representation theory problems. We looked closely at Kronecker Coefficients and the Tensor Square Conjecture, with different conjec- tures that spiral from it. Li came up with a conjecture that progresses on the Saxl Con- jecture, and we came up with a …
-
Some Results in Combinatorial Number Theory
… lower bounds for $s(d)$ for $d\leq 10000$ and then demonstrate lower and upper bounds $\left\lfloor\sqrt{4d+895}+1\right\rfloor\leq s(d)< 24801d^{3} + 942d^{2} + 3$ for all $d\geq 1$. In the second chapter we ask if $Q(x)\in\mathbb{R}[x]$ is a degree $d$ polynomial such that for …
-
Theory and application of back-tracking techniques
… However, the size of the problem that can be handled is limited by the speed and by the accessibility of the computer. Back-tracking is a technique that provides a more efficient method of solving such problems, and thus enables larger problems to he handled. Chapter I introduces the subject of …
Page 1 of 15