Related papers: Minimal determining sets for certain $W$-graph ide…
Let $G$ be a simple $n$-vertex graph and $W\subseteq\V(G)$. We say that $W$ is a $\delta_k$-small set if $$ \sqrt[k]{\frac{\sum_{v\in W}d^k(v)}{\abs W}}\leq n-\abs W. $$ Let $\varphi^{(k)}(G)$ denote the smallest natural number $r$ such…
We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the…
Let $M$ be an uniformizable Anderson $t$-motive of rank $r$, $L$ its lattice and $l_*:=\{l_1,\dots, l_r\}$ its basis. We define a map $\delta$ from the set of these bases to a flag variety (the present text gives the definition of $\delta$…
A dominating set $S$ in a graph is a subset of vertices such that every vertex is either in $S$ or adjacent to a vertex in $S$. A minimal dominating set $M$ is a dominating set such that $M-v$ is not a dominating set for all $v \in M$. In…
A regular nilpotent Hessenberg Schubert cell is the intersection of a regular nilpotent Hessenberg variety with a Schubert cell. In this paper, we describe a set of minimal generators of the defining ideal of a regular nilpotent Hessenberg…
The study of Hermitian forms on a real reductive group $G$ gives rise, in the unequal rank case, to a new class of Kazhdan-Lusztig-Vogan polynomials. These are associated with an outer automorphism $\delta$ of $G$, and are related to…
Let $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of…
In this work, we consider $\mathbb{Z}^d$-shifts generated by digit substitutions. For such a shift $\mathbb{X}$, we study the elements of the normaliser of $\mathbb{Z}^d$ in the group of self homeomorphisms (called extended symmetries)…
Based on empirical evidence obtained using the {\sf CHEVIE} computer algebra system, we present a series of conjectures concerning the combinatorial description of the Kazhdan--Lusztig cells for type $B_n$ with unequal parameters. These…
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general…
The structure of Hamiltonian reductions of the Wess-Zumino-Novikov-Witten (WZNW) theory by first class Kac-Moody constraints is analyzed in detail. Lie algebraic conditions are given for ensuring the presence of exact integrability,…
We study the acylindrical hyperbolicity of the outer automorphism group of a right-angled Artin group $A_\Gamma$. When the defining graph $\Gamma$ has no SIL-pair (separating intersection of links), we obtain a necessary and sufficient…
The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P, up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erd\H{o}s and Moser from the 1960s. The minimum was always considered to be less…
Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and an…
For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…
Let $(W,S)$ be a finite Coxeter group. Kazhdan and Lusztig introduced the concept of $W$-graphs and Gyoja proved that every irreducible representation of the Iwahori-Hecke algebra $H(W,S)$ can be realized as a $W$-graph. Gyoja defined an…
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…