中文
相关论文

相关论文: How special is your Aronszajn tree?

200 篇论文

Alavi, Malde, Schwenk and Erd\H{o}s asked whether the independent set sequence of every tree is unimodal. Here we make some observations about this question. We show that for the uniformly random (labelled) tree, asymptotically almost…

组合数学 · 数学 2021-07-06 Abdul Basit , David Galvin

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

形式语言与自动机理论 · 计算机科学 2024-07-02 Achim Blumensath

Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some…

计算机科学中的逻辑 · 计算机科学 2015-02-25 Claudia Carapelle , Shiguang Feng , Alexander Kartzow , Markus Lohrey

In this paper, first some results of [5] are extended for subadditive separating maps between C(X;E) and C(Y;E), such that E is a unital Banach algebra. Then we give some conditions under which a strongly subadditive map has a unique fixed…

泛函分析 · 数学 2015-06-02 Yousef Estaremi , Bahman Moeini

We show that if a topological or paratopological group $G$ contains a stationary subset of some regular uncountable cardinal, then $G$ contains a subspace which is not collectionwise normal. This statement implies that if a monotonically…

一般拓扑 · 数学 2012-09-24 Raushan Buzyakova , Cetin Vural

For a global field K and an elliptic curve E_eta over K(T), Silverman's specialization theorem implies that rank(E_eta(K(T))) <= rank(E_t(K)) for all but finitely many t in P^1(K). If this inequality is strict for all but finitely many t,…

数论 · 数学 2007-05-23 B. Conrad , K. Conrad , H. Helfgott

The classical Aronszajn-Donoghue theorem states that for a rank one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As…

泛函分析 · 数学 2022-05-20 Constanze Liaw , Sergei Treil , Alexander Volberg

An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…

统计力学 · 物理学 2013-09-25 Ewan Colman , Geoff Rodgers

The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense,…

数据结构与算法 · 计算机科学 2009-07-14 Prosenjit Bose , Karim Douïeb , Vida Dujmović , John Howat

We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of…

逻辑 · 数学 2023-07-19 Rahman Mohammadpour

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

组合数学 · 数学 2017-02-28 Reinhard Diestel

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…

逻辑 · 数学 2008-02-03 Shmuel Lifsches , Saharon Shelah

Arboreal singularities are an important class of Lagrangian singularities. They are conical, meaning that they can be understood by studying their links, which are singular Legendrian spaces in $S^{2n-1}_{\text{std}}$. Loose Legendrians are…

辛几何 · 数学 2019-02-14 Emmy Murphy

We comment on a question of Justin Moore on colourings of pairs of nodes in an Aronszajn tree and solve an instance of it.

逻辑 · 数学 2007-05-23 Mirna Džamonja , Jean Larson

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…

Exceptional modules are tree modules. A tree module usually has many tree bases and the corresponding coefficient quivers may look quite differently. The aim of this note is to introduce a class of exceptional modules which have a…

表示论 · 数学 2013-02-27 Claus Michael Ringel

A set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

组合数学 · 数学 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

Let E --> C be an elliptic surface defined over a number field K. For each finite covering C' --> C defined over K, let E' --> C' be the pullback. We give a strong upper bound for the rank of E'(C'/K) in the case that C' --> C is an…

数论 · 数学 2007-07-09 Joseph H. Silverman

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $\epsilon>0$, there is a Euclidean Steiner…

计算几何 · 计算机科学 2026-05-27 Devin Frost , Kimberly Kokado , Csaba D. Tóth

In this paper we prove that every definable set has a definable triangulation which is locally Lipschitz and weakly bi-Lipschitz on the natural simplicial stratification of the simplicial complex. We also distinguish a class T of regularity…

微分几何 · 数学 2014-11-11 Malgorzata Czapla
‹ 上一页 1 8 9 10 下一页 ›