English
Related papers

Related papers: A Koszul filtration for the second squarefree Vero…

200 papers

Koszul algebras with quadratic Groebner bases, called strong Koszul algebras, are studied. We introduce affine algebraic varieties whose points are in one-to-one correspondence with certain strong Koszul algebras and we investigate the…

Rings and Algebras · Mathematics 2017-02-10 Edward L. Green

We study a properly convex real projective manifold with (possibly empty) compact, strictly convex boundary, and which consists of a compact part plus finitely many convex ends. We extend a theorem of Koszul which asserts that for a compact…

Geometric Topology · Mathematics 2018-03-28 Daryl Cooper , Darren Long , Stephan Tillmann

Let $G$ be a finite simple connected graph on the vertex set $V(G)=[d]=\{1,\dots ,d\}$, with edge set $E(G)=\{e_{1},\dots , e_{n}\}$. Let $K[\mathbf{t}]=K[t_{1},\dots , t_{d}]$ be the polynomial ring in $d$ variables over a field $K$. The…

Commutative Algebra · Mathematics 2023-10-13 Nayana Shibu Deepthi

Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…

Combinatorics · Mathematics 2026-04-29 Adrian Dumitrescu , János Pach , Morteza Saghafian , Alex Scott

A fullerene graph can be embedded in a piecewise linear 2-manifold with each non-hexagonal carbon ring corresponding to a cone vertex. Adjacent two or three such vertices can be combined as a cluster cut out from a parent cone round a…

Combinatorics · Mathematics 2023-03-15 Shaoqing Li

Let $H$ be a numerical semigroup. We give effective bounds for the multiplicity $e(H)$ when the associated graded ring $\operatorname{gr}_\mathfrak{m} K[H]$ is defined by quadrics. We classify Koszul complete intersection semigroups in…

Commutative Algebra · Mathematics 2017-10-18 Jürgen Herzog , Dumitru I. Stamate

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

Combinatorics · Mathematics 2016-08-24 Marcin Wrochna

It is known that if any prime power branched cyclic cover of a knot in the 3-sphere is a homology sphere, then the knot has vanishing Casson-Gordon invariants. We construct infinitely many examples of (topologically) non-slice knots in the…

Geometric Topology · Mathematics 2007-05-23 Taehee Kim

Seymour Second Neighborhood Conjecture (SSNC) asserts that every finite oriented graph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood. Such a vertex is called a Seymour vertex. A digraph $D =…

Combinatorics · Mathematics 2024-05-29 Dania Mezher , Moussa Daamouch

We show that if $G$ is a graph on $n$ vertices, with all degrees comparable to some $d = d(n)$, and without a sparse cut, for a suitably chosen notion of sparseness, then it contains a complete minor of order \[ \Omega\left( \sqrt{\frac{n…

Combinatorics · Mathematics 2019-04-01 Michael Krivelevich , Rajko Nenadov

We associate to each real algebraic variety a filtered chain complex, the weight complex, which is well-defined up to filtered quasi-isomorphism, and which induces on classical (compactly supported) homology with Z/2 coefficients an analog…

Algebraic Geometry · Mathematics 2017-01-16 Clint McCrory , Adam Parusinski

We provide a new criterion for flexibility of cones over varieties covered by flexible affine varieties. We apply this criterion to prove flexibility of affine cones over secant varieties of Segre--Veronese embeddings and over certain Fano…

Algebraic Geometry · Mathematics 2024-04-18 Matheusz Michałek , Alexander Perepechko , Hendrik Süß

We study perfect multiple coverings in translation invariant graphs with vertex set $\mathbb{Z}^2$ using an algebraic approach. In this approach we consider any such covering as a two-dimensional binary configuration which we then express…

Combinatorics · Mathematics 2023-01-13 Elias Heikkilä , Pyry Herva , Jarkko Kari

We prove that for a large family of product graphs, and for Kneser graphs $K(n,\alpha n)$ with fixed $\alpha <1/2$, the following holds. Any set of vertices that spans a small proportion of the edges in the graph can be made independent by…

Combinatorics · Mathematics 2018-01-23 Ehud Friedgut , Oded Regev

We establish that the dioperad $Y^{(n)}$, encoding bialgebras with a product of degree zero, a coproduct of degree $(1-n)$ and a rank three cyclic tensor, which satisfy a deformed version of the balanced infinitesimal bialgebra condition,…

Algebraic Topology · Mathematics 2026-04-09 Alex Takeda

Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…

Combinatorics · Mathematics 2012-08-28 Benjamin A. Burton

In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are standard graded. In this context we exhibit a duality…

Commutative Algebra · Mathematics 2011-11-03 Shamila Bayati , Farhad Rahmati

We describe semiinfinite cohomology of associative algebras in terms of Koszul (or bar) duality. Consider an associative algebra $A$ and two its subalgebras $B$ and $N$ such that $A=B\otimes N$ as a vector space. We prove that the…

q-alg · Mathematics 2008-02-03 Sergey Arkhipov

A $hole$ is an induced cycle of length at least four, and an odd hole is a hole of odd length. A {\em fork} is a graph obtained from $K_{1,3}$ by subdividing an edge once. An {\em odd balloon} is a graph obtained from an odd hole by…

Combinatorics · Mathematics 2023-09-06 Di Wu , Baogang Xu

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

Combinatorics · Mathematics 2025-07-03 Tim Berezin