Related papers: Appendix to the paper "Randomly Growing Braid on T…
This paper is an appendix to the paper "Random walks on free products of cyclic groups" by J.Mairesse and F.Math\'eus. It contains the details of the computations and the proofs of the results concerning the examples treated there.
Consider the braid group $B_3=< a,b| aba=bab>$ and the nearest neighbor random walk defined by a probability $\nu$ with support $\{a,a^{-1},b,b^{-1}\}$. The rate of escape of the walk is explicitly expressed in function of the unique…
The following article is one of introduction to additive frieze patterns, linking the subject to multiplicative frieze patterns. We also add two new theorems about additive frieze patterns (see theorem 2 and 5) and a conjecture about…
In this supplementary appendix we provide proofs and additional extensive simulations that complement the analysis of the main paper (constrained perturbation regularization approach for signal estimation using random matrix theory).
In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…
This text is an appendix to our work "On the growth of Kronecker coefficients", arXiv:1607.02887. Here, we provide some complementary theorems, remarks, and calculations that for the sake of space are not going to appear into the final…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
This appendix for our article, "Almost-rainbow edge-colorings of some small subgraphs", contains the full proof of Theorem 4.1.
In this appendix we tabulate preliminary data used in establishing Theorem 1-14 in the paper ``The Chow rings of generalized Grassmannians''
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
We prove three conjectures, related to the paperfolding sequence, in a recent paper [arXiv:2005.04066] of P. Barry.
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
This text consists of the introduction, table of contents, and bibliography of a long manuscript (703 pages) that is currently submitted for publication. This manuscript develops an extension of Garside's approach to braid groups and…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
We give a proof of the Radford's Biproduct Theorem in S. Montgomery's book [Hopf Algebras and Their Actions on Rings, CBMS 82, AMS,1993.] by using Majid's braided diagrams method and Yu.Bespalov and V. Lyubashenko's "t-angles.sty" package.
This is an appendix to our paper "An update of the Hirsch Conjecture" (arXiv:0907.1186), containing proofs of some of the results and comments that were omitted in it.
General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph H, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and…
Character expansion expresses extended HOMFLY polynomials through traces of products of finite dimensional R- and Racah mixing matrices. We conjecture that the mixing matrices are expressed entirely in terms of the eigenvalues of the…
Generalizing work of Marin [12], we construct in a unified way all the "braids and ties'' algebras available in literature and new ones.