Related papers: Le cerf-volant d'une constellation
A stable set in a graph G is a set of mutually non-adjacent vertices, alpha(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable sets. In this paper we demonstrate that in a tree T, of order…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
This paper proves a stability result for a variation of the Erd\H{o}s-Ko-Rado theorem in the context of polynomials over finite fields. Let $\mathcal F$ be a family of polynomials of degree at most $k \geq 3$ in $\mathbb F_q[X]$. Call…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
An involution on a finite set is a bijection such as I(I(e))=e for all the element of the set. A fixed-point free involution on a finite set is an involution such as I(e)=e for none element of the set. In this article, the fixed-point free…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
In response to a well-known open question ``Does every complete geometric graph on $2n\/$ vertices have a partition of its edge set into $n\/$ plane spanning trees?" we provide an affirmative answer when the complete geometry graph is in…
Starting from the defining two-point and three-point functions of Celestial CFTs, Euclidean integral blocks are constructed for the OPE of scalar primaries. In their integral form they can alternatively be fixed using Poincar\'e symmetry…
Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect…
We consider a self-homeomorphism h of some surface S. A subset F of the fixed point set of h is said to be unlinked if there is an isotopy from the identity to h that fixes every point of F. With Le Calvez' transverse foliations theory in…
We consider reflexive and involutive transition systems over an ordered alphabet $A$ equipped with an involution. We give a description of the injective envelope of any two-element set in terms of Galois lattice, from which we derive a test…
A rotation in a Euclidean space V is an orthogonal map on V which acts locally as a plane rotation with some fixed angle. We give a classification of all pairs of rotations in finite-dimensional Euclidean space, up to simultaneous…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
The paper is concerned with families of plane algebraic curves that contain a given and quite special finite set X of points in the projective plane. We focus on the case in which the set X is formed by transversally intersecting pairs of…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
A Ferrers rook graph is a graph whose vertices correspond to the dots in a Ferrers diagram, and where two vertices are adjacent if they are in the same row or the same column. We propose a conjectural formula for the gonality of Ferrers…
In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining…
Let $\Aa_t$ be the directed quiver of type $\Aa$ with $t$ vertices. For each dimension vector $d$ there is a dense orbit in the corresponding representation space. The principal aim of this note is to use just rank conditions to define the…