Search arXivSearch

arXiv · 2202.10463

Hypergraph LSS-ideals and coordinate sections of symmetric tensors

Abstract

Let K be a field, [n]= {1,...,n} and H=([n],E) be a hypergraph. For an integer d >= 1 the Lovasz-Saks-Schrijver ideal (LSS-ideal) L_H^K (d) in K[y_{ij}~:~(i,j) \in [n] x [d]] is the ideal generated by the polynomials $f^{(d)}_{e}= \sum\limits_{j=1}^{d} \prod\limits_{i \in e} y_{ij}$ for edges e of H. In this paper for an algebraically closed field K and a k-uniform hypergraph H=([n],E) we employ a connection between LSS-ideals and coordinate sections of the closure of the set S_{n,k}^d of homogeneous degree k symmetric tensors in n variables of rank <= d to derive results on the irreducibility of its coordinate sections. To this end we provide results on primality and the complete intersection property of L_H^K (d). We then use the combinatorial concept of positive matching decomposition of a hypergraph H to provide bounds on when L_H^K(d) turns prime to provide results on the irreducibility of coordinate sections of S_{n, k}^d.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shekoofeh Gharakhloo, Volkmar Welker. 2022-02-21. Hypergraph LSS-ideals and coordinate sections of symmetric tensors. https://doi.org/10.1080/00927872.2023.2196339

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO