combinatorial description
Recently Published Documents


TOTAL DOCUMENTS

89
(FIVE YEARS 17)

H-INDEX

9
(FIVE YEARS 0)

2022 ◽  
Vol 19 (1) ◽  
Author(s):  
Liena Colarte-Gómez ◽  
Rosa M. Miró-Roig

AbstractIn this paper, we study the geometry of GT-varieties $$X_{d}$$ X d with group a finite cyclic group $$\Gamma \subset {{\,\mathrm{GL}\,}}(n+1,\mathbb {K})$$ Γ ⊂ GL ( n + 1 , K ) of order d. We prove that the homogeneous ideal $${{\,\mathrm{I}\,}}(X_{d})$$ I ( X d ) of $$X_{d}$$ X d is generated by binomials of degree at most 3 and we provide examples reaching this bound. We give a combinatorial description of the canonical module of the homogeneous coordinate ring of $$X_{d}$$ X d and we show that it is generated by monomial invariants of $$\Gamma $$ Γ of degree d and 2d. This allows us to characterize the Castelnuovo–Mumford regularity of the homogeneous coordinate ring of $$X_d$$ X d . Finally, we compute the cohomology table of the normal bundle of the so-called RL-varieties. They are projections of the Veronese variety $$\nu _{d}(\mathbb {P}^{n}) \subset \mathbb {P}^{\left( {\begin{array}{c}n+d\\ n\end{array}}\right) -1}$$ ν d ( P n ) ⊂ P n + d n - 1 which naturally arise from level GT-varieties.


Author(s):  
Davide Bolognini ◽  
Antonio Macchia ◽  
Francesco Strazzanti

AbstractThe cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible graphs as the graphs with unmixed binomial edge ideal and whose cut sets form an accessible set system. We prove that the graphs whose binomial edge ideal is Cohen–Macaulay are accessible and we conjecture that the converse holds. We settle the conjecture for large classes of graphs, including chordal and traceable graphs, providing a purely combinatorial description of Cohen–Macaulayness. The key idea in the proof is to show that both properties are equivalent to a further combinatorial condition, which we call strong unmixedness.


Author(s):  
C. BLANCHET ◽  
M. DE RENZI ◽  
J. MURAKAMI

AbstractWe provide a combinatorial description of the monoidal category generated by the fundamental representation of the small quantum group of $$ \mathfrak{sl} $$ sl 2 at a root of unity q of odd order. Our approach is diagrammatic, and it relies on an extension of the Temperley–Lieb category specialized at δ = −q − q−1.


Author(s):  
Ido Efrat

Abstract For a prime number p and a free profinite group S on the basis X, let $S_{\left (n,p\right )}$ , $n=1,2,\dotsc ,$ be the p-Zassenhaus filtration of S. For $p>n$ , we give a word-combinatorial description of the cohomology group $H^2\left (S/S_{\left (n,p\right )},\mathbb {Z}/p\right )$ in terms of the shuffle algebra on X. We give a natural linear basis for this cohomology group, which is constructed by means of unitriangular representations arising from Lyndon words.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Jackson Autry ◽  
Abigail Ezell ◽  
Tara Gomes ◽  
Christopher O’Neill ◽  
Christopher Preuss ◽  
...  

Abstract Several recent papers have examined a rational polyhedron Pm whose integer points are in bijection with the numerical semigroups (cofinite, additively closed subsets of the non-negative integers) containing m. A combinatorial description of the faces of Pm was recently introduced, one that can be obtained from the divisibility posets of the numerical semigroups a given face contains. In this paper, we study the faces of Pm containing arithmetical numerical semigroups and those containing certain glued numerical semigroups, as an initial step towards better understanding the full face structure of Pm . In most cases, such faces only contain semigroups from these families, yielding a tight connection to the geometry of Pm .


Author(s):  
Subhankar Dey ◽  
Hakan Doğa

In this paper, we give a combinatorial description of the concordance invariant [Formula: see text] defined by Hom, prove some properties of this invariant using grid homology techniques. We compute the value of [Formula: see text] for [Formula: see text] torus knots and prove that [Formula: see text] if [Formula: see text] is a grid diagram for a positive braid. Furthermore, we show how [Formula: see text] behaves under [Formula: see text]-cabling of negative torus knots.


Author(s):  
Tristan Bozec

Abstract This paper gives a combinatorial description of the set of irreducible components of the semistable locus of the global nilpotent cone, in genus $\ge 2$.


Author(s):  
Christin Bibby ◽  
Nir Gadish

Abstract From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this “orbit configuration space” is the complement of an arrangement of subvarieties inside the Cartesian product, and we use this structure to study its topology. We give an abstract combinatorial description of its poset of layers (connected components of intersections from the arrangement), which turns out to be of much independent interest as a generalization of partition and Dowling lattices. The close relationship to these classical posets is then exploited to give explicit cohomological calculations.


Author(s):  
Jose Agapito ◽  
Pasquale Petrullo ◽  
Domenico Senato ◽  
Maria M. Torres

AbstractThrough the action of the Weyl algebra on the geometric series, we establish a generalization of the Worpitzky identity and new recursive formulae for a family of polynomials including the classical Eulerian polynomials. We obtain an extension of the Dobiński formula for the sum of rook numbers of a Young diagram by replacing the geometric series with the exponential series. Also, by replacing the derivative operator with the q-derivative operator, we extend these results to the q-analogue setting including the q-hit numbers. Finally, a combinatorial description and a proof of the symmetry of a family of polynomials introduced by one of the authors are provided.


Sign in / Sign up

Export Citation Format

Share Document