English
Related papers

Related papers: Reading escaping trees from Hubbard trees in Sn

200 papers

In this work we study orthogonal polynomials via polynomial mappings in the framework of the $H_q-$semiclassical class. We consider two monic orthogonal polynomial sequences $\{p_n (x)\}_{n\geq0}$ and $\{q_n(x)\}_{n\geq0}$ such that $$…

Classical Analysis and ODEs · Mathematics 2017-12-19 K. Castillo , M. N. De Jesus , F. Marcellán , J. Petronilho

We study the thick points of branching Brownian motion and branching random walk with a critical branching mechanism, focusing on the critical dimension $d = 4$. We determine the exponent governing the probability to hit a small ball with…

Probability · Mathematics 2025-12-01 Nathanaël Berestycki , Tom Hutchcroft , Antoine Jego

Let $p(z)$ be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the {\it Voronoi property} if it lies in the Voronoi cell of a root $\theta$, $V(\theta)$, i.e. the set of points…

Numerical Analysis · Computer Science 2014-01-22 Bahman Kalantari

Cima, Ma\~{n}osas and Villadelprat (J. Differ. Equations, 157, 373--413, 1999) proved that a cubic Hamiltonian system possesses an isochronous center at the origin if and only if its Hamiltonian function can be expressed as…

Dynamical Systems · Mathematics 2025-12-23 Jihua Yang

The space of monic squarefree complex polynomials has a stratification according to the multiplicities of the critical points. We introduce a method to study these strata by way of the infinite-area translation surface associated to the…

Geometric Topology · Mathematics 2023-04-17 Nick Salter

A large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$.…

Data Structures and Algorithms · Computer Science 2026-03-26 Stefan Kratsch

Given two binary trees on $N$ labeled leaves, the quartet distance between the trees is the number of disagreeing quartets. By permuting the leaves at random, the expected quartets distance between the two trees is…

Combinatorics · Mathematics 2021-01-01 Benny Chor , Péter L. Erdős , Yonatan Komornik

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

Group Theory · Mathematics 2011-03-22 Denis Osin , Mark Sapir

The multiplier $\lambda_n$ of a periodic orbit of period $n$ can be viewed as a (multiple-valued) algebraic function on the space of all complex quadratic polynomials $p_c(z)=z^2+c$. We provide a numerical algorithm for computing critical…

Dynamical Systems · Mathematics 2019-02-28 Anna Belova , Igors Gorbovickis

Given a set $P$ of $n$ points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial structure during the point movement. The objective is to…

Computational Geometry · Computer Science 2022-06-28 Haitao Wang , Yiming Zhao

We study the Coulomb chain where particles are restricted to one dimension and experience three-dimensional Coulomb interactions with their nearest and next-to-nearest neighbours. The distances between consecutive particles are treated as…

Probability · Mathematics 2024-04-24 Henrik Ekström

This paper demonstrates that every ultrametric space is homeomorphic to a clade space of a pruned tree, i.e., a subspace of a tree's canopy. Furthermore, it characterizes several topological properties of ultrametrizable spaces through the…

General Topology · Mathematics 2024-08-01 Itamar Bellaïche

Let $P$ be a monic polynomial of degree $n$ with roots $x_1,\ldots,x_n$. We study the discriminants of the derivatives $P^{(k)}$ as symmetric translation-invariant polynomials in the original roots. The general ``square-graph cone''…

Classical Analysis and ODEs · Mathematics 2026-05-26 Boris Shapiro

A long-standing conjecture on spanning trees of a hypercube states that a balanced tree on $2^n$ vertices with maximum degree at most $3$ spans the hypercube of dimension $n$ \cite{havel1986}. In this paper, we settle the conjecture for a…

Combinatorics · Mathematics 2021-10-13 Rishikant Rajdeepak , V. Sunitha

Bounding the number of preperiodic points of quadratic polynomials with rational coefficients is one case of the Uniform Boundedness Conjecture in arithmetic dynamics. Here, we provide a general framework that may reduce finding periodic…

Number Theory · Mathematics 2015-04-17 Zhiming Wang , Robin Zhang

We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…

Probability · Mathematics 2019-05-31 Tom Hutchcroft

Within the 1D Hubbard model linear closed chains with various numbers of sites are considered in Self Consistent Random Phase Approximation (SCRPA). Excellent results with a minimal numerical effort are obtained for 2+4n sites cases,…

Strongly Correlated Electrons · Physics 2009-11-10 Mohsen Jemai , Peter Schuck , Jorge Dukelsky , Raouf Bennaceur

We prove tight mixing time bounds for natural random walks on bases of matroids, determinantal distributions, and more generally distributions associated with log-concave polynomials. For a matroid of rank $k$ on a ground set of $n$…

Data Structures and Algorithms · Computer Science 2021-04-13 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant , Thuy Duong Vuong

In purely repulsive, $C_{4v}$-symmetric Hubbard clusters a correlation effect produces an effective two-body attraction and pairing; the key ingredient is the availability of W=0 pairs, that is, two-body solutions of appropriate symmetry.…

Strongly Correlated Electrons · Physics 2016-08-31 Agnese Callegari , Michele Cini , Enrico Perfetto , Gianluca Stefanucci

In a previous paper, we studied the connection between points in $\mathbb{H}^n$ and $2$-dimensional rigid adelic spaces on a totally real number field $K$ with class number $h_K = 1$. This last assumption was needed to link heights and…

Number Theory · Mathematics 2025-10-27 Mathieu Dutour
‹ Prev 1 4 5 6 7 8 10 Next ›