A graphic arrangement $\A_G$ associated with a simple graph $G$ is a classical and well-studied object in the theory of hyperplane arrangements. In this note, we show that, for a connected graph $G$, a slight modification of the logarithmic vector field $D(\A_G)$ of $\A_G$ is isomorphic to the face ring of a certain simplicial poset. This allows us to give formulas for several algebraic invariants of $D(\A_G)$, such as its Hilbert series, local cohomology, projective dimension, and Castelnuovo--Mumford regularity, in terms of combinatorial and topological information about the corresponding simplicial poset. As a by-product, we also give an explicit vector space basis of $D(\A_G)$.
In this paper we study irreducible simplicial arrangements of projective planes in $\mathbb{P}^{3}(\mathbb{R})$ from combinatorial and projective geometry viewpoints. We first formulate a simpliciality criterion in terms of incidences between rank-two and rank-three flats, together with equivalent formulations using fa...
The bounds on the number of Eulerian orientations for certain classes of connected, loopless $4-regular graphs are improved and a divide-and-conquer algorithm is provided that leverages structural properties to compute the exact number of Eulerian orientations for separable graphs without exhaustive enumeration.
We obtain density Ramsey theorems for configurations consisting of the vertices of a simplex $\Delta_o$ together with their barycenter. We prove that any subset $A\subseteq\mathbb{R}^n$ of positive upper density contains an isometric copy of all sufficiently large dilates of $\Delta_o$ together with its barycenter. As...
We prove that every simplicial triangulation of real projective $d$-space has $\exp(\Omega(\sqrt d))$ vertices. Together with known constructions, this determines the minimum vertex number as $\mu_d=\exp(d^{1/2+o(1)})$. The result follows from a topological generalization of the Figiel--Lindenstrauss--Milman inequality...
Florian Frick, Kaave Hosseini, Eric Myzelev et al.· 1 citation
We prove an incidence bound for bipartite graphs on finite subsets of $\mathbb{F}^2\times \mathbb{F}^2$ defined by Boolean combinations of polynomial equations of bounded degree. If such a graph is $K_{k,k}$-free and its vertex classes have sizes $m$ and $n$, then it has $O_{t,k}((mn)^{2/3}+m+n+mn/p)$ edges, where $t$...
Let $L$ be a finite-dimensional Lie algebra over a field $F$. The comaximal graph $\Gamma(L)$ has as vertices the proper nonzero subalgebras of $L$, two of them adjacent whenever they generate $L$; its structure was previously classified for Lie algebras of dimension at most 3 over finite fields. Here we extend that wo...
David A. Towers, Y. Zuleta, Ismael Gutierrez· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
