Related papers: Resonance varieties, admissible line combinatorics…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentation is provided with…
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…
Building upon the work of Buczy\'nska et al., we study here tensor formats and their corresponding encoding of tensors via two-fold tensor products determined by the combinatorics of a binary tree. The set of all tensors representable by a…
A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized admissible pinnacle sets of permutations. For these sets,…
Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
A class of trigonometric interpolation splines depending on parameter vectors, selected convergence factors and interpolation factors is considered. The concept of crosslink grids and interpolation grids is introduced; these grids can match…
A hypertoric variety is a quaternionic analogue of a toric variety. Just as the topology of toric varieties is closely related to the combinatorics of polytopes, the topology of hypertoric varieties interacts richly with the combinatorics…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…
This book is a detailed introduction to the theory of finite type (Vassiliev) knot invariants, with a stress on its combinatorial aspects. It is intended to serve both as a textbook for readers with no or little background in this area, and…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
In this paper, we provide an alternative proof of Donaldson's almost-holomorphic section theorem and symplectic Lefschetz pencil theorem, through constructions of certain special kind of Donaldson-type sections of the line bundle based on…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
Word embeddings are effective intermediate representations for capturing semantic regularities between words, when learning the representations of text sequences. We propose to view text classification as a label-word joint embedding…
We define a right Cartan-Eilenberg structure on the category of Kan's combinatorial spectra, and the category of sheaves of such spectra, assuming some conditions. In both structures, we use the geometric concept of homotopy equivalence as…