Related papers: On a rank-unimodality conjecture of Morier-Genoud …
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove…
Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…
The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…
For a non-zero algebraic number $\alpha$ of degree $d$, let $h(\alpha)$ denote its logarithmic Weil height. It is known that when $h(\alpha)$ is small, and $d$ is large, the conjugates of $\alpha$ are clustered near the unit circle and have…
There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…
We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…
A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…
The standard models of sequence evolution on a tree determine probabilities for every character or site pattern. A flattening is an arrangement of these probabilities into a matrix, with rows corresponding to all possible site patterns for…
A cluster is a finite set of generators of a cluster algebra. The Laurent Phenomenon of Fomin and Zelevinsky says that any element of a cluster algebra can be written as a Laurent polynomial in terms of any cluster. The upper cluster…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…
We conjecture a strong property for the up and down maps U and D in an r-differential poset: DU+tI and UD+tI have Smith normal forms over Z[t]. In particular, this would determine the integral structure of the maps U, D, UD, DU, including…
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…
The Huneke-Wiegand conjecture has prompted much recent research in Commutative Algebra. In studying this conjecture for certain classes of rings, Garc\'ia-S\'anchez and Leamer construct a monoid S_\Gamma^s whose elements correspond to…
We prove that the bounded derived category of the lattice of order ideals of the product of two ordered chains is fractionally Calabi-Yau. We also show that these lattices are derived equivalent to higher Auslander algebras of type A. The…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…