English
Related papers

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

200 papers

A recent framework for generalizing the Erdos-Ko-Rado Theorem, due to Holroyd, Spencer, and Talbot, defines the Erdos-Ko-Rado property for a graph in terms of the graph's independent sets. Since the family of all independent sets of a graph…

Combinatorics · Mathematics 2011-01-27 Russ Woodroofe

In this note, we prove a conjecture of Puder on an extension of the co-growth formula to any non-negative function defined on a bi-regular tree. A key component of our proof is the establishment of a resolvent identity, which serves as an…

Combinatorics · Mathematics 2025-02-11 Wenbo Li , Joe Thomas

We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…

Logic · Mathematics 2025-10-16 Ali N. Valizadeh , Massoud Pourmahdian

We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…

Probability · Mathematics 2020-06-15 Steven Heilman

An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.

Algebraic Topology · Mathematics 2012-01-20 Ittay Weiss

We show that $(n,d,\lambda)$-graphs with $\lambda=O(d/\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form…

Combinatorics · Mathematics 2023-11-07 Joseph Hyde , Natasha Morrison , Alp Müyesser , Matías Pavez-Signé

We establish a variety of extensions to the Erdos-Rado Theorem, particularly involving ordinal numbers, and always involving ordinary partition relations. Most of the results can be regarded as consequences of the Ramification Principle,…

Logic · Mathematics 2009-09-25 J. Baumgartner , A. Hajnal. S. Todorcevic

We prove several extensions of the Erdos-Fuchs theorem.

Number Theory · Mathematics 2016-08-31 Li-Xia Dai , Hao Pan

We work with semi-algebraic functions on arbitrary real closed fields. We generalize the notion of critical values and prove a Sard type theorem in our framework.

Algebraic Geometry · Mathematics 2015-03-17 Anna Valette , Guillaume Valette

The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property…

Group Theory · Mathematics 2011-10-21 Maciej Malicki

In this article we study a singular Vlasov system on the torus where the force field has the smoothness of a (fractional) derivative $D^{\alpha}$ of the density, where $\alpha>0$. We prove local well-posedness in Sobolev spaces without…

Analysis of PDEs · Mathematics 2022-02-16 Thomas Chaub

In this paper, we provide a common generalization to the well-known Erd\H{o}s-Ko-Rado Theorem, Frankl-Wilson Theorem, Alon-Babai-Suzuki Theorem, and Snevily Theorem on set systems with $\mathcal{L}$-intersections. As a consequence, we…

Combinatorics · Mathematics 2017-07-07 Jiuqiang Liu , Shenggui Zhang , Jimeng Xiao

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

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…

Number Theory · Mathematics 2025-10-30 Anne Broise-Alamichel , Jouni Parkkonen , Frédéric Paulin

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

The seminal papers of Edmonds \cite{Egy}, Nash-Williams \cite{NW} and Tutte \cite{Tu} have laid the foundations of the theories of packing arborescences and packing trees. The directed version has been extensively investigated, resulting in…

Combinatorics · Mathematics 2024-11-26 Pierre Hoppenot , Mathis Martin , Zoltán Szigeti

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

Combinatorics · Mathematics 2016-05-25 Hao Huang , Yi Zhao

We prove a general Fueter Theorem over real alternative *-algebras. We show that a suitable power of the Laplacian maps Dunkl-regular functions to Dunkl monogenic functions with axial symmetries. Using the embedding of hypercomplex function…

Complex Variables · Mathematics 2026-04-15 Alessandro Perotti

We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…

Group Theory · Mathematics 2008-01-31 Gilbert Levitt

There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical…

Combinatorics · Mathematics 2014-03-11 Zoltán Füredi , Dániel Gerbner , Máté Vizer