Related papers: Uniforming n-place functions on ds(alpha)

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

Data structures known as $k$-d trees have numerous applications in scientific computing, particularly in areas of modern statistics and data science such as range search in decision trees, clustering, nearest neighbors search, local…

We develop technical tools that enable the use of Bellman functions for BMO defined on $\alpha$-trees, which are structures that generalize dyadic lattices. As applications, we prove the integral John--Nirenberg inequality and an inequality…

Let T d (n) be the set of d-ary rooted trees with n internal nodes. We give a method to construct a sequence (t n , n $\ge$ 0) where, for any n $\ge$ 1, t n has the uniform distribution in T d (n), and t n is constructed from t n--1 by the…

In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…

Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…

Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…

In the present work the rooted and unrooted d-regular maps on 2-dimentional oriented surfaces of genus g are enumerated. Separately and in more detail the case of d-regular maps with a single face are considered.

By extending the breadth first search algorithm to any d-type critical or subcritical irreducible branching forest, we show that such forests may be encoded through d independent, integer valued, d-dimensional random walks. An application…

We prove a generalization of the fundamental theorem of algebraic K-theory for Verdier-localizing functors by extending the proof for algebraic K-theory of spaces to the realm of stable $\infty$-categories. The formula behaves much better…

Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered…

Let R be a unit-regular ring, and let a,b,c in R satisfy aba=aca. If ac and ba are group invertible, we prove that ac is similar to ba. Furthermore, if ac and ba are Drazin invertible, then their Drazin inverses are similar. For any n\times…

We establish strong well-posedness for a class of degenerate SDEs of kinetic type with autonomous diffusion driven by a symmetric $\alpha$-stable process under H\"older regularity conditions for the drift term. We partially recover the…

We prove the Myers-Steenrod theorem for local topological groups of isometries acting on pointed $\mathcal{C}^{k,\alpha}$-Riemannian manifolds, with $k+\alpha>0$. As an application, we infer a new regularity result for a certain class of…

We consider an Erd\H{o}s-Ko-Rado type sum that weights each member of a uniform family according to its smallest intersection with the rest of the family. We prove that once the ground set is sufficiently large this sum is at most one, with…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

In this article we show how Gr\"un's results in group theory can be used for studying the structure of class groups in normal extensions.

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

By the introduction of locally constant prefactorization algebras at a fixed scale, we show a mathematical incarnation of the fact that observables at a given scale of a topological field theory propagate to every scale over euclidean…