English
Related papers

Related papers: Realizing trees of configurations in thin sets

200 papers

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{i}$ the degree of vertex $v_{i}$. Let $f(x, y)>0$ be a real symmetric function in $x$ and $y$. The weighted adjacency matrix $A_{f}(G)$ of a graph $G$ is a square matrix, where the…

Combinatorics · Mathematics 2022-12-06 Ruiling Zheng , Xiaxia Guan , Xian an Jin

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

Combinatorics · Mathematics 2021-05-03 Christian Elbracht , Jan Kurkofka , Maximilian Teegen

The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with proper thinness~1 are exactly the proper interval graphs. A…

Combinatorics · Mathematics 2025-05-19 Flavia Bonomo-Braberman , Ignacio Maqueda , Nina Pardal

Each infinitesimally faithful representation of a reductive complex connected algebraic group $G$ induces a dominant morphism $\Phi$ from the group to its Lie algebra $\g$ by orthogonal projection in the endomorphism ring of the…

Representation Theory · Mathematics 2007-05-23 Bertram Kostant , Peter W. Michor

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

Combinatorics · Mathematics 2017-05-08 Péter Csikvári

Let $X$ and $Y$ be completely regular spaces and $E$ and $F$ be Hausdorff topological vector spaces. We call a linear map $T$ from a subspace of $C(X,E)$ into $C(Y,F)$ a \emph{Banach-Stone map} if it has the form $Tf(y) = S_{y}(f(h(y))$ for…

Functional Analysis · Mathematics 2009-06-02 Denny H. Leung , Wee-Kee Tang

In [J. Bures, R. Lavicka, V. Soucek, Elements of quaternionic analysis and Radon transform, Textos de Matematica 42, Departamento de Matematica, Universidade de Coimbra, 2009], the authors describe a link between holomorphic functions…

Complex Variables · Mathematics 2014-06-20 Fabrizio Colombo , Roman Lavicka , Irene Sabadini , Vladimir Soucek

We identify a set of sufficient local conditions under which a significant portion of a Radon measure $\mu$ on $\mathbb{R}^{n+1}$ with compact support can be covered by an $n$-uniformly rectifiable set at the level of a ball $B\subset…

Analysis of PDEs · Mathematics 2019-11-12 Carmelo Puliatti

In this paper the Erdos-Rado theorem is generalized to the class of well founded trees.

Logic · Mathematics 2020-02-25 Esther Gruenhut , Saharon Shelah

We show $\ell^p\big(\mathbb Z^d\big)$ boundedness, for $p\in(1, \infty)$, of discrete singular integrals of Radon type with the aid of appropriate square function estimates, which can be thought as a discrete counterpart of the…

Classical Analysis and ODEs · Mathematics 2018-03-16 Mariusz Mirek

Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…

Combinatorics · Mathematics 2017-03-30 Daniel Weißauer

In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…

Logic · Mathematics 2026-01-14 Darío García , Melissa Robles

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

Logic · Mathematics 2015-07-22 Ari Meir Brodsky

Motivated by a conjecture of Gy\'arf\'as, recently B\"ottcher, Hladk\'y, Piguet, and Taraz showed that every collection $T_1,\dots,T_t$ of trees on $n$ vertices with $\sum_{i=1}^te(T_i)\leq \binom{n}{2}$ and with bounded maximum degree, can…

Combinatorics · Mathematics 2016-04-20 Silvia Messuti , Vojtěch Rödl , Mathias Schacht

Let $T$ be a tree with an irreducible characteristic polynomial $\phi(x)$ over $\mathbb{Q}$. Let $\Delta(T)$ be the discriminant of $\phi(x)$. It is proved that if $2^{-\frac n2}\sqrt{\Delta(T)}$ (which is always an integer) is odd and…

Combinatorics · Mathematics 2023-10-03 Yizhe Ji , Wei Wang , Hao Zhang

Let $\phi:S^2 \to S^2$ be an orientation-preserving branched covering whose post-critical set has finite cardinality $n$. If $\phi$ has a fully ramified periodic point $p_{\infty}$ and satisfies certain additional conditions, then, by work…

Algebraic Geometry · Mathematics 2020-04-20 Rohini Ramadas

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…

Geometric Topology · Mathematics 2023-03-03 Ethan Farber

Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…

Classical Analysis and ODEs · Mathematics 2013-07-05 Vincent Chan , Izabella Laba , Malabika Pramanik

The Radon transform is a bounded operator from $L^p$ of Euclidean space to $L^q$ of the manifold of all affine hyperplanes in $\mathbb{R}^n$ for certain exponents depending dimension. Extremizers have been determined for certain values of…

Classical Analysis and ODEs · Mathematics 2025-08-04 Taryn C. Flock

We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…

Discrete Mathematics · Computer Science 2021-04-30 Jan Böker