English
Related papers

Related papers: A Rigid Kurepa Tree From a Free Suslin Tree

200 papers

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

Combinatorics · Mathematics 2012-05-03 B. S. Kochkarev

The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not depend on the nature of the (regular uncountable)…

Logic · Mathematics 2025-09-09 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing total weight of edges, whose weights…

Statistical Mechanics · Physics 2007-05-23 Dong-Hee Kim , Jae Dong Noh , Hawoong Jeong

We present a class of abelian groups that exhibit a high degree of freeness while possessing no non-trivial homomorphisms to a canonical free object. Unlike prior investigations, which primarily focused on torsion-free groups, our work…

Group Theory · Mathematics 2025-11-11 Mohsen Asgharzadeh , Mohammad Golshani , Saharon Shelah

We define a notion of free product for coarse spaces that generalizes the corresponding notion of a free product for groups. We show that free products preserve coarse properties such as coarse property C, finite coarse decomposition…

Geometric Topology · Mathematics 2020-06-26 Greg Bell , Austin Lawson

Let $A$ be a unital $C^*$-algebra generated by some separable operator system $S$. More than a decade ago, Arveson conjectured that $S$ is hyperrigid in $A$ if all irreducible representations of $A$ are boundary representations for $S$.…

Operator Algebras · Mathematics 2025-10-10 Raphaël Clouâtre , Ian Thompson

The tree forcing method given by (Liu 2015) enables the cone avoiding of strong enumeration of a given tree, within a subset or co-subset of an arbitrary given set, provided the given tree does not admit computable strong enumeration. Using…

Logic · Mathematics 2019-12-20 Bjørn Kjos-Hanssen , Lu Liu

We investigate the property of boundary rigidity for the projective structures associated to torsion-free affine connections on connected analytic manifolds with boundary. We show that these structures are generically boundary rigid,…

Differential Geometry · Mathematics 2024-07-11 Jack Borthwick , Niky Kamran

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…

Rings and Algebras · Mathematics 2009-11-27 Laurent Bartholdi

We introduce tree linear cascades, a class of linear structural equation models for which the error variables are uncorrelated but need not be Gaussian nor independent. We show that, in spite of this weak assumption, the tree structure of…

Methodology · Statistics 2022-02-16 Nicholas C. Landolfi , Sanjay Lall

We first identify (up to linear isomorphism) the Lipschitz free spaces of quasiarcs. By decomposing quasiconformal trees into quasiarcs as done in an article of David, Eriksson-Bique, and Vellis, we then identify the Lipschitz free spaces…

Metric Geometry · Mathematics 2023-03-16 David M. Freeman , Chris Gartland

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

Combinatorics · Mathematics 2026-02-12 Caelan Wang , Karen Yeats

The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…

Logic in Computer Science · Computer Science 2020-10-19 Xuan-Bach Le , Aquinas Hobor , Anthony W. Lin

We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…

Combinatorics · Mathematics 2024-01-11 George Barmpalias , Xiaoyan Zhang

We consider planar rooted random trees whose distribution is even for fixed height $h$ and size $N$ and whose height dependence is given by a power function $h^\alpha$. Defining the total weight for such trees of fixed size to be $Z_N$, a…

Probability · Mathematics 2023-04-05 Bergfinnur Durhuus , Meltem Ünel

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

Group Theory · Mathematics 2026-03-20 Clinton T. Conley , Damien Gaboriau , Andrew S. Marks , Robin D. Tucker-Drob

We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020),…

Operator Algebras · Mathematics 2021-04-13 Ethan Davis , David Jekel , Zhichao Wang

Let $K$ be a global function field of characteristic $p$, and let $\Gamma$ be a finite-index subgroup of an arithmetic group defined with respect to $K$ and such that any torsion element of $\Gamma$ is a $p$-torsion element. We define…

Group Theory · Mathematics 2018-03-28 Daniel Studenmund , Kevin Wortman

We present a characterization of spaces of strictly decreasing functions on trees in terms of bisequentiality. This characterization answers Questions 6.1 and 6.2 of "A filter on a collection of finite sets and Eberlein compacta" by T.…

General Topology · Mathematics 2018-09-06 Claudio Agostini , Jacopo Somaglia

The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…

Logic · Mathematics 2016-09-06 Yuri Gurevich , Saharon Shelah
‹ Prev 1 8 9 10 Next ›