Related papers: Wonderful models for toric arrangements

Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…

We present a decomposition of the space of twisted arcs of a toric stack. As a consequence, we give a combinatorial description of the motivic integral associated to a torus-invariant divisor of a toric stack.

We propose a simple new combinatorial model to study spaces of acyclic Jacobi diagrams, in which they are identified with algebras of words modulo operations. This provides a starting point for a word-problem type combinatorial…

In this paper, we examine the combinatorial properties of conic arrangements in the complex projective plane that possess certain quasi-homogeneous singularities. First, we introduce a new tool that enables us to characterize the property…

We study intersection theory on the relative Hilbert scheme of a family of nodal-or-smooth curves, over a base of arbitrary dimension. We introduce an additive group called 'discriminant module', generated by diagonal loci, node scrolls,…

We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…

Real or complex tensor model observables, the backbone of the tensor theory space, are classical (unitary, orthogonal, symplectic) Lie group invariants. These observables represent as colored graphs, and that representation gives an handle…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Operads are algebraic devices offering a formalization of the concept of operations with several inputs and one output. Such operations can be naturally composed to form bigger and more complex ones. Coming historically from algebraic…

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…

The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…

In this paper we use formal group rings to construct an algebraic model of the $T$-equivariant oriented cohomology of smooth toric varieties. Then we compare our model with known results of equivariant cohomology of toric varieties to…

Predictive theory to geometrically engineer devices and materials in continuum systems to have desired topological-like effects is developed here by bridging the gap between quantum and continuum mechanical descriptions. A platonic crystal,…

Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…

I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…

We construct a combinatorial generalization of the Leray models for hyperplane arrangement complements. Given a matroid and some combinatorial blowup data, we give a presentation for a bigraded (commutative) differential-graded algebra. If…

We give an intrinsic definition of toric symplectic stacks, and show that they are classified by simple convex polytopes equipped with some additional combinatorial data. This generalizes Delzant's classification of toric symplectic…

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

In this article we give combinatorial criteria to decide whether a transitive cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes, together with an explicit construction in the case that such a family…