Related papers: Experimental Number Theory, Part I : Tower Arithme…
This is the first chapter in our "Toric Topology" book project. Further chapters are coming. Comments and suggestions are very welcome.
Goodwillie's calculus of homotopy functors associates a tower of polynomial approximations, the Taylor tower, to a functor of topological spaces over a fixed space. We define a new tower, the varying center tower, for functors of categories…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
Tensors are ubiquitous in statistics and data analysis. The central object that links data science to tensor theory and algebra is that of a model with latent variables. We provide an overview of tensor theory, with a particular emphasis on…
We discuss an extension of classical combinatorics theory to the case of spatially distributed objects.
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
$ $[This paper is a (self contained) chapter in a new book, Mathematics and Computation, whose draft is available on my homepage at https://www.math.ias.edu/avi/book ]. We survey some concrete interaction areas between computational…
The Neighbor-Joining algorithm is a popular distance-based phylogenetic method that computes a tree metric from a dissimilarity map arising from biological data. Realizing dissimilarity maps as points in Euclidean space, the algorithm…
We study the representation theory of three towers of algebras which are related to the symmetric groups and their Hecke algebras. The first one is constructed as the algebras generated simultaneously by the elementary transpositions and…
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…
In this pages I give an overview of the relationship between Model Theory, Arithmetic and Algebraic Geometry. The topics will be the basic ones in the area, so this is just an invitation, in the presentation of topics I mainly follow the…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
Hurwitz numbers enumerate branched morphisms between Riemannn surfaces with fixed numerical data. They represent important objects in enumerative geometry that are accessible by combinatorial techniques. In the past decade, many variants of…
This is the second chapter in our "Toric Topology" book project. Further chapters are coming. Comments and suggestions are very welcome.
We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…