Related papers: Algebraically rigid simplicial complexes and graph…
Let $\Delta$ be a simplicial complex on $V = \{x_1,...,x_n\}$, with Stanley-Reisner ideal $I_{\Delta}\subseteq R = k[x_1,...,x_n]$. The goal of this paper is to investigate the class of artinian algebras $A=A(\Delta,a_1,...,a_n)=…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
Let $\Delta$ be simplicial complex and let $k[\Delta]$ denote the Stanley--Reisner ring corresponding to $\Delta$. Suppose that $k[\Delta]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We prove a graded version of Alev-Polo's rigidity theorem: the homogenization of the universal enveloping algebra of a semisimple Lie algebra and the Rees ring of the Weyl algebras $A_n(k)$ cannot be isomorphic to their fixed subring under…
Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…
The Gruenberg-Kegel graph of a group is the undirected graph whose vertices are those primes which occur as the order of an element of the group, and distinct vertices $p$, $q$ are joined by an edge whenever the group has an element of…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…
For a graph $G$, Bayer-Denker-Milutinovi\'c-Rowlands-Sundaram-Xue study in \cite{B-D-M-R-S-X} a new graph complex $\Delta_k^t(G)$, namely the simplicial complex with facets that are complements to independent sets of size $k$ in $G$. They…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
A finite poset $P$ is called "simplicial", if it has the smallest element $\hat{0}$, and every interval $[\hat{0}, x]$ is a boolean algebra. The face poset of a simplicial complex is a typical example. Generalizing the Stanley-Reisner ring…
In this paper we construct an infinite family of homotopically rigid spaces. These examples are then used as building blocks to forge highly connected rational spaces with prescribed finite group of self-homotopy equivalences. They are also…
We study three invariants of geometrically vertex decomposable ideals: the Castelnuovo-Mumford regularity, the multiplicity, and the $a$-invariant. We show that these invariants can be computed recursively using the ideals that appear in…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…
A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…