The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuß-Catalan generalizations. ...

Let $G$ be a finite group and $S$ be a symmetric generating set of $G$ with $|S| = d$. We show that if the undirected Cayley sum graph $C_{\Sigma}(G,S)$ is an expander graph and is non-bipartite, then the spectrum of its ...

Squarefree powers of edge ideals are intimately related to matchings of the underlying graph. In this paper we give bounds for the regularity of squarefree powers of edge ideals, and we consider the question of when such ...

A pair of non-empty subsets $(W,W')$ in an abelian group $G$ is a complement pair if $W+W'=G$. $W'$ is said to be minimal to $W$ if $W+(W'\setminus \{w'\}) \neq G, \forall \,w'\in W'$. In general, given an arbitrary subset ...

Let $A$ be a $K$-subalgebra of the polynomial ring $S=K[x_1,\ldots,x_d]$ of dimension $d$, generated by finitely many monomials of degree $r$. Then the Gauss algebra $\mathbb{G}(A)$ of $A$ is generated by monomials of ...

For $X$ a metric space and $r > 0$ a scale parameter, the Vietoris–Rips complex $VR_<(X; r)$ (resp. $VR_≤(X; r)$) has $X$ as its vertex set, and a finite subset $\sigma \subseteq X$ as a simplex whenever the diameter of ...

Specializations of Schur functions are exploited to define and evaluate the Schur functions $s_\lambda [\alpha X]$ and plethysms $s_\lambda [\alpha s_\nu(X))]$ for any $\alpha$-integer, real or complex. Plethysms are then ...

We prove general fomulas for the deviations of two overpartition ranks from the average, namely \begin{equation*} \overline{D}(a, M) := \sum_{n \geq 0} \Bigl( \overline{N}(a, M, n) - \frac{\overline{p}(n)}{M} \Bigr) q^n ...

The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning ...

The Varchenko determinant is the determinant of a matrix defined from an arrangement of hyperplanes. Varchenko proved that this determinant has a beautiful factorization. It is, however, not possible to use this factorization ...