Related papers: Restricted Chain-Order Polytopes via Combinatorial…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
A graph whose nodes have degree 1 or 3 is called a $\{1,3\}$-graph. Liu and Osserman associated a polytope to each $\{1,3\}$-graph and studied the Ehrhart quasi-polynomials of these polytopes. They showed that the vertices of these…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and…
This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let \pi_K be…
We study the phase behavior of random heteropolymers (RHPs) with quenched cross-links, a novel polymer class of technological and biological relevance, and show the possible occurrence of freezing with few chain conformations sampled. The…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
In this paper we study the class of polytopes which can be obtained by taking the convex hull of some subset of the points $\{e_i-e_j \ \vert \ i \neq j\} \cup \{\pm e_i\}$ in $\mathbb{R}^n$, where $e_1,\dots,e_n$ is the standard basis of…
In this paper, we explore the interplay between symmetry and fracton order, motivated by the analogous close relationship for topologically ordered systems. Specifically, we consider models with 3D planar subsystem symmetry, and show that…
A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…
We have studied the exciton states in two coupled conjugated polymer chains which are modeled individually by the Su-Schrieffer-Heeger Hamiltonian and coupled by an interchain electron-transfer term. Both the intra- and inter-chain long…
We exhibit the limit shape of random Young diagrams having a distribution proportional to the exponential of their area, and confined in a rectangular box. The Ornstein-Uhlenbeck bridge arises from the fluctuations around the limit shape.
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…
Orthogonal polynomials satisfy a recurrence relation of order two, where appear two coefficients. If we modify one of these coefficients at a certain order, we obtain a perturbed orthogonal sequence. In this work we consider in this way…
Given an integral hyperplane arrangement, Kamiya-Takemura-Terao (2008 & 2011) introduced the notion of characteristic quasi-polynomial, which enumerates the cardinality of the complement of the arrangement modulo a positive integer. The…
We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.
Modern applications of algebraic topology to point cloud data analysis have motivated active investigation of combinatorial clique complexes -- high-dimensional extensions of combinatorial graphs. We show that meaningful invariants of such…
This thesis presents new applications of Gale duality to the study of polytopes, point configurations and oriented matroids with extremal combinatorial properties. The first part of the thesis explores construction techniques for neighborly…
A deluge of new data on social, technological and biological networked systems suggests that a large number of interactions among system units are not limited to pairs, but rather involve a higher number of nodes. To properly encode such…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…