Related papers: On symmetric quadrangulations and triangulations

A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…

We introduce two classes of algebras coming from partial triangulations of marked surfaces. The first one, called frozen algebra of a partial triangulation, is generally of infinite rank and contains frozen Jacobian algebras of…

The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…

The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…

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…

Two immersed triangulations in the plane with the same combinatorics are considered as preimage and image of a discrete immersion $F$. We compare the cross-ratios $Q$ and $q$ of corresponding pairs of adjacent triangles in the two…

Given a plane triangle $\Delta$, one can construct a new triangle $\Delta'$ whose vertices are intersections of two cevian triples of $\Delta$. We extend the family of operators $\Delta\mapsto\Delta'$ by complexifying the defining two…

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…

Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. As an application of these results we can deduce a complete…

We give an expansion in $1/N$ and $\beta$ of the cumulants of power sums of the particles of the $\beta$-ensemble. This new expansion is obtained using the tridiagonal model of Dumitriu and Edelman. The coefficients of the expansion are…

This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…

By systematically applying ten well-known and inequivalent two-part relations between hypergeometric sums 3F2(...|1) to the published database of all such sums, 62 new sums are obtained. The existing literature is summarized, and many…

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…

Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…

In the present paper, we revisit the geometry of smooth plane quartics and their bitangents from several perspectives. First, we study in detail the weak combinatorics of arrangements of bitangents associated with highly symmetric quartic…