Related papers: Constructing non-uniquely ergodic arational trees
We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…
Nous donnons des r\'esultats d'\'equidistribution d'\'el\'ements de corps de fonctions sur des corps finis, et d'irrationnels quadratiques sur ces corps, dans leurs corps locaux compl\'et\'es. Nous d\'eduisons ces r\'esultats de…
We construct non-isogenous simple ordinary abelian varieties over an algebraic closure of a finite field with isomorphic endomorphism algebras.
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
A note on "Bayesian nonparametric estimators derived from conditional Gibbs structures" by Antonio Lijoi, Igor Pr\"{u}nster, Stephen G. Walker [arXiv:0808.2863].
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
We describe symbolic constructions for listing and enumerating graphs having the same induced edge label sequence. We settle in the affirmative R. Whitty's [W08] conjectured existence of determinantal constructions for listing and…
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…
This work harnesses interpretable machine learning methods to address the challenging inverse design problem of origami-inspired systems. We show that a decision tree-random forest method is particularly suitable for fitting origami…
One must add arrows which are forced by transitivity to form the transitive closure of a directed graph. We introduce a construction of a transitive directed graph which is formed by adding vertices instead of arrows and which preserves the…
We give archimedean and non-archimedean constructions of Darmon points on modular abelian varieties attached to automorphic forms over arbitrary number fields and possibly non-trivial central character. An effort is made to present a…
We extend Ribet's Nondegeneracy theorem to all odd weight Hodge structures.
We introduce a new perspective on a procedure for generating pseudo-Anosov homemorphisms from postcritically finite interval maps. The central idea is the realization of a tree structure on one such family of pseudo-Anosovs: individual…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
After stating several tools which can be used to construct indecomposable tree modules for quivers without oriented cycles, we use these methods to construct indecomposable tree modules for every imaginary Schur root. These methods also…
Neural Networks and Decision Trees: two popular techniques for supervised learning that are seemingly disconnected in their formulation and optimization method, have recently been combined in a single construct. The connection pivots on…
We consider groups of piecewise-projective homeomorphisms of the line which are known to be non-amenable using notably the Carriere--Ghys theorem on ergodic equivalence relations. Replacing that theorem by an explicit fixed-point argument,…
In this paper, we establish the ergodicity of the Airy line ensemble. This shows that it is the only candidate for Conjecture 3.2 in [3], regarding the classification of ergodic line ensembles satisfying a certain Brownian Gibbs property…