Related papers: Balanced squeezed Complexes

Given a simplicial complex, it is easy to construct a generic deformation of its Stanley-Reisner ideal. The main question under investigation in this paper is how to characterize the simplicial complexes such that their Stanley-Reisner…

Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in this order. We are motivated by the problem of…

The chromatic number $\chi$ of a graph is bounded from below by its clique number $\omega,$ but it can be arbitrary large. Perfect graphs are defined by $\chi=\omega$ for all induced subgraphs. An interesting relaxation are $\chi$-bounded…

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

A formalism for the construction of some classes of Gazeau$-$Klauder squeezed states, corresponding to arbitrary solvable quantum systems with a known discrete spectrum, are introduced. As some physical applications, the proposed structure…

Let I be a homogeneous ideal of a polynomial ring S. We prove that if the initial ideal J of I, w.r.t. a term order on S, is square-free, then the extremal Betti numbers of S/I and of S/J coincide. In particular, depth(S/I)=depth(S/J) and…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

We prove several relations on the $f$-vectors and Betti numbers of flag complexes. For every flag complex $\Delta$, we show that there exists a balanced complex with the same $f$-vector as $\Delta$, and whose top-dimensional Betti number is…

Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…

Let $k$ be a field of odd characteristic $p$. Fix an even number $d<p+1$ and a power $q\geq d+3$ of $p$. For most choices of degree $d$ standard graded hypersurfaces $R=k[x,y,z]/(f)$ with homogeneous maximal ideal $\mathfrak{m}$, we can…

We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node $u$ of degree $d(u)$ is assigned a palette of $d(u)+1$ colors, and the goal is to find a proper coloring using these color palettes. The…

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

Consider an ideal $I\subset K[x_1,..., x_n]$, with $K$ an arbitrary field, generated by monomials of degree two. Assuming that $I$ does not have a linear resolution, we determine the step $s$ of the minimal graded free resolution of $I$…

Let $S=K[x_1,\dots,x_n]$ be a polynomial ring in $n$ variables with coefficients over a field $K$. A $t$-spread lexsegment ideal $I$ of $S$ is a monomial ideal generated by a $t$-spread lexsegment set. We determine all $t$-spread lexsegment…

We consider semidefinite relaxations of Stable-Set and Coloring, which are based on quadratic 0-1 optimization. Information about the stability number and the chromatic number is hidden in the objective function. This leads to simplified…

Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is either generated by four squarefree monomials of degrees $d$ and others of…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

We study mixtures of decomposable graphical models, focusing on their ideals and dimensions. For mixtures of clique stars, we characterize the ideals in terms of ideals of mixtures of independence models. We also give a recursive formula…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…

A natural extension of bipartite graphs are $d$-partite clutters, where $d \geq 2$ is an integer. For a poset $P$, Ene, Herzog and Mohammadi introduced the $d$-partite clutter $\mathcal{C}_{P,d}$ of multichains of length $d$ in $P$, showing…