Related papers: Combinatorics of Bricard's octahedra
A Kokotsakis polyhedron with quadrangular base is a neighborhood of a quadrilateral in a quad surface. Generically, a Kokotsakis polyhedron is rigid. Up to now, several flexible classes were known, but a complete classification was missing.…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose…
A celebrated result of Bousquet-M\'elou and Jehanne states that the bivariate power series solutions of so-called combinatorial polynomial equations with one catalytic variable, also known as catalytic equations, are algebraic series. We…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
Goldman and Turaev found a Lie bialgebra structure on the vector space generated by non-trivial free homotopy classes of curves on a surface. When the surface has non-empty boundary, this vector space has a basis of cyclic reduced words in…
The E. Cartan's equations defining "simple" spinors (renamed "pure" by C. Chevalley) are interpreted as equations of motions for fermion multiplets in momentum spaces which, in a constructive approach based bilinearly on those spinors,…
In this paper we describe a methodology for the identification of symmetric quadrature rules inside of quadrilaterals, triangles, tetrahedra, prisms, pyramids, and hexahedra. The methodology is free from manual intervention and is capable…
We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…
We address two longstanding open problems, one originating in PL topology, another in birational geometry. First, we prove the weighted version of Oda's \emph{strong factorization conjecture} (1978), and prove that every two birational…
The modern algebra concepts are used to construct tables of algebraic spinors related to Clifford algebra multivectors with real and complex coefficients. The following data computed by Mathematica are presented in form of tables for…
Gradient vector fields are fundamental objects from both theoretical and practical perspectives, since various phenomena can be modeled within this framework. The ``moduli space'' of such vector fields provides the foundation for describing…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…
We extend to a scheme-theoretic context the notion of a combinatorial differential form, due to A.Kock in the framework of synthetic differential geometry. We show that group-valued combinatorial forms on a scheme may be identified, under…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
We describe new explicit examples of moduli spaces of Bridgeland semistable objects on surfaces, parametrizing objects whose numerical class agrees with the class of a point. This follows ideas of Tramel and Xia, using stability conditions…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…