English
Related papers

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

200 papers

In this note we define a generalization of Hall-Littlewood symmetric functions using formal group law and give an elementary proof of the generating function formula for the generalized Hall-Littlewood symmetric functions. We also give some…

Rings and Algebras · Mathematics 2018-09-28 Hiroshi Naruse

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

Logic in Computer Science · Computer Science 2015-07-01 Amélie Gheerbrant , Balder ten Cate

In this paper, we prove a new ergodic theorem for $\mathbb{R}^d$-actions involving averages over dilated submanifolds, thereby generalizing the theory of spherical averages. Our main result is a quantitative estimate for the error term of…

Number Theory · Mathematics 2025-04-04 Prasuna Bandi , Reynold Fregoli , Dmitry Kleinbock

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

Probability · Mathematics 2016-12-15 Benedikt Stufler

We prove a fix point theorem for monoids of self-embeddings of trees. As a corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either contains a subdivided binary tree as a subtree or has a vertex, and edge, an end or…

Combinatorics · Mathematics 2017-09-19 Matthias Hamann

The classical Erd\H os-Ko-Rado theorem states that if $k\le\floor{n/2}$ then the largest family of pairwise intersecting $k$-subsets of $[n]=\{0,1,...,n\}$ is of size ${{n-1}\choose{k-1}}$. A family of $k$ subsets satisfying this pairwise…

Combinatorics · Mathematics 2012-04-12 Patricia A. Carey , Anant P. Godbole

We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…

Probability · Mathematics 2008-07-04 Bo Chen , Daniel Ford , Matthias Winkel

We prove the Erd\H os--S\'os conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a…

Combinatorics · Mathematics 2020-08-13 Guido Besomi , Matías Pavez-Signé , Maya Stein

The space of unordered configurations of distinct points in the plane is aspherical, with Artin's braid group as its fundamental group. Remarkably enough, the space of ordered configurations of distinct points on the real projective line,…

Algebraic Topology · Mathematics 2007-05-23 Jack Morava

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

Consider a class of skew product transformations consisting of an ergodic or a periodic transformation on a probability space (M, B, m) in the base and a semigroup of transformations on another probability space (W,F,P) in the fibre. Under…

Dynamical Systems · Mathematics 2007-10-08 Julia Brettschneider

We introduce a large scale analogue of the classical fixed-point property for continuous maps, which shall apply to coarse maps. We also develop a coarse version of degree for coarse maps on Euclidean spaces. Then, applying a coarse…

Algebraic Topology · Mathematics 2010-08-31 Steven Hair

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…

Complex Variables · Mathematics 2021-06-14 Kirill Lazebnik , Nikolai G. Makarov , Sabyasachi Mukherjee

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

Number Theory · Mathematics 2024-03-27 M Krithika , P Vanchinathan

Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…

Representation Theory · Mathematics 2023-07-06 Haibo Jin , Dong Yang , Guodong Zhou

We describe a general construction providing index theorems localizing the Chern classes of the normal bundle of a subvariety inside a complex manifold. As particular instances of our construction we recover both Lehmann-Suwa's…

Complex Variables · Mathematics 2007-05-23 Marco Abate , Filippo Bracci , Francesca Tovena

In this paper we at first consider plane trees with the root vertex and a marked directed edge, outgoing from the root vertex. For such trees we introduce a new characteristic --- the \emph{parity}, using the bracket code. It turns out that…

Combinatorics · Mathematics 2018-11-27 Irina Busjatskaja , Yury Kochetkov

This paper further develops the theory of arbitrary semigroups acting on trees via elliptic mappings. A key tool is the Lyndon-Chiswell length function L for the semigroup S which allows one to construct a tree T and an action of S on T via…

Group Theory · Mathematics 2012-04-02 John Rhodes , Pedro V. Silva

We consider two stationary versions of the Eden model, on the upper half planar lattice, resulting in an infinite forest covering the half plane. Under weak assumptions on the weight distribution and by relying on ergodic theorems, we prove…

Probability · Mathematics 2015-06-18 Tonći Antunović , Eviatar B. Procaccia

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle
‹ Prev 1 8 9 10 Next ›