USING COMBINATORIAL MAPS FOR ALGORITHMS ON GRAPHS

The aim of this paper is to come back to a data structure representation of graph by permutations. This originated in the years 1960-1970 by contributions due to J. Edmonds [7], A. Jacques [11], W. Tutte [22] in order to consider the embedding of a graph in a surface as a combinatorial object. Some algebraic developments where suggested in [4] and [12]. It was also used for implementation in different situation, like planarity testing by H. de Fraysseix and P. Rosenstiehl [6], computer vision by G. Damiand and A. Dupas [5] or formal proofs by G. Gonthier [9].

A skeleton model to enumerate standard puzzle sequences

<abstract><p>Guo-Niu Han [Sémin. Lothar. Comb. 85 (2021) B85c (electronic)] has introduced a new combinatorial object named standard puzzle. We use digraphs to show the relations between numbers in standard puzzles and propose a skeleton model. By this model, we solve the enumeration problem of over fifty thousand standard puzzle sequences. Most of them can be represented by classical numbers, such as Catalan numbers, double factorials, secant numbers and so on. Also, we prove several identities for standard puzzle sequences.</p></abstract>

Deformation Cones of Nested Braid Fans

Generalized permutohedra are deformations of regular permutohedra and arise in many different fields of mathematics. One important characterization of generalized permutohedra is the Submodularity Theorem, which is related to the deformation cone of the Braid fan. We lay out general techniques for determining deformation cones of a fixed polytope and apply it to the Braid fan to obtain a natural combinatorial proof for the Submodularity Theorem. We also consider a refinement of the Braid fan, called the nested Braid fan, and construct usual (respectively, generalized) nested permutohedra that have the nested Braid fan as (respectively, a coarsening of) their normal fan. We extend many results on generalized permutohedra to this new family of polytopes, including a one-to-one correspondence between faces of nested permutohedra and chains in ordered partition posets, and a theorem analogous to the Submodularity Theorem. Finally, we show that the nested Braid fan is the barycentric subdivision of the Braid fan, which gives another way to construct this new combinatorial object.

Group Decision Diagram (GDD): A Compact Representation for Permutations

Permutation is a fundamental combinatorial object appeared in various areas in mathematics, computer science, and artificial intelligence. In some applications, a subset of a permutation group must be maintained efficiently. In this study, we develop a new data structure, called group decision diagram (GDD), to maintain a set of permutations. This data structure combines the zero-suppressed binary decision diagram with the computable subgroup chain of the permutation group. The data structure enables efficient operations, such as membership testing, set operations (e.g., union, intersection, and difference), and Cartesian product. Our experiments demonstrate that the data structure is efficient (i.e., 20–300 times faster) than the existing methods when the permutation group is considerably smaller than the symmetric group, or only subsets constructed by a few operations over generators are maintained.

The importance of the whole: Topological data analysis for the network neuroscientist

Data analysis techniques from network science have fundamentally improved our understanding of neural systems and the complex behaviors that they support. Yet the restriction of network techniques to the study of pairwise interactions prevents us from taking into account intrinsic topological features such as cavities that may be crucial for system function. To detect and quantify these topological features, we must turn to algebro-topological methods that encode data as a simplicial complex built from sets of interacting nodes called simplices. We then use the relations between simplices to expose cavities within the complex, thereby summarizing its topological features. Here we provide an introduction to persistent homology, a fundamental method from applied topology that builds a global descriptor of system structure by chronicling the evolution of cavities as we move through a combinatorial object such as a weighted network. We detail the mathematics and perform demonstrative calculations on the mouse structural connectome, synapses in C. elegans, and genomic interaction data. Finally, we suggest avenues for future work and highlight new advances in mathematics ready for use in neural systems.

Criteria for Hattori–Masuda multi-polytopes via Duistermaat–Heckman functions and winding numbers

A multi-fan (respectively multi-polytope), introduced first by Hattori and Masuda, is a purely combinatorial object generalizing an ordinary fan (respectively polytope) in algebraic geometry. It is well known that an ordinary fan or polytope is associated with a toric variety. On the other hand, we can geometrically realize multi-fans in terms of torus manifolds. However, it is unfortunate that two different torus manifolds may correspond to the same multi-fan. The goal of this paper is to give some criteria for a multi-polytope to be an ordinary polytope in terms of the Duistermaat–Heckman functions and winding numbers. Moreover, we also prove a generalized Pick formula and its consequences for simple lattice multi-polytopes by studying their Ehrhart polynomials.

Generating the Mapping Class Group

This chapter considers the Dehn–Lickorish theorem, which states that when g is greater than or equal to 0, the mapping class group Mod(Sɡ) is generated by finitely many Dehn twists about nonseparating simple closed curves. The theorem is proved by induction on genus, and the Birman exact sequence is introduced as the key step for the induction. The key to the inductive step is to prove that the complex of curves C(Sɡ) is connected when g is greater than or equal to 2. The simplicial complex C(Sɡ) is a useful combinatorial object that encodes intersection patterns of simple closed curves in Sɡ. More detailed structure of C(Sɡ) is then used to find various explicit generating sets for Mod(Sɡ), including those due to Lickorish and to Humphries.

Asymptotic Behavior of Odd-Even Partitions

Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's "Lost" Notebook, there are several formulas involving this function, but they are not as simple as the identities with other similar shape of functions. Nonetheless, Andrews found out that this function possesses combinatorial information, odd-even partition. In this paper, we provide the asymptotic formula for this combinatorial object. We also study its companion odd-even overpartitions.

SQUARES AND NARROW SYSTEMS

A narrow system is a combinatorial object introduced by Magidor and Shelah in connection with work on the tree property at successors of singular cardinals. In analogy to the tree property, a cardinalκsatisfies thenarrow system propertyif every narrow system of heightκhas a cofinal branch. In this paper, we study connections between the narrow system property, square principles, and forcing axioms. We prove, assuming large cardinals, both that it is consistent that ℵω+1satisfies the narrow system property and$\square _{\aleph _\omega , < \aleph _\omega } $holds and that it is consistent that every regular cardinal satisfies the narrow system property. We introduce natural strengthenings of classical square principles and show how they can be used to produce narrow systems with no cofinal branch. Finally, we show that the Proper Forcing Axiom implies that every narrow system of countable width has a cofinal branch but is consistent with the existence of a narrow system of width ω1with no cofinal branch.