中文
相关论文

相关论文: Reading escaping trees from Hubbard trees in Sn

200 篇论文

We prove that Misiurewicz parameters with prescribed combinatorics and hyperbolic parameters with (d - 1) distinct attracting cycles with given multipliers are equidistributed with respect to the bifurcation measure in the moduli space of…

动力系统 · 数学 2013-02-05 Charles Favre , Thomas Gauthier

We construct an arithmetic period map for cubic fourfolds, in direct analogy with Rizov's work on K3 surfaces. For each $N\geq 1$, we introduce a Deligne-Mumford stack $\widetilde{\mathcal{C}^{[N]}}$ of cubic fourfolds with level structure…

数论 · 数学 2025-12-15 Rikuto Ito

We prove that topologically conjugate non-renormalizable polynomials are quasi-conformally conjugate. From this we derive that each such polynomial can be approximated by a hyperbolic polynomial. As a by product we prove that the Julia set…

动力系统 · 数学 2014-02-26 Oleg Kozlovski , Sebastian van Strien

Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…

种群与进化 · 定量生物学 2019-05-23 Tom M. W. Nye

Non-Hermtian (NH) Hamiltonians effectively describing the physics of dissipative systems have become an important tool with applications ranging from classical meta-materials to quantum many-body systems. Exceptional points, the NH…

强关联电子 · 物理学 2021-09-22 Lorenzo Crippa , Jan Carl Budich , Giorgio Sangiovanni

We give a linear relation between a cubic Gaussian period and a root of Shanks' cubic polynomial in wildly ramified cases.

数论 · 数学 2025-10-06 Miho Aoki

For any admissible pair of irreducible reduced crystallographic root systems, we present discrete orthogonality relations for a finite-dimensional system of Macdonald polynomials with parameters on the unit circle subject to a truncation…

表示论 · 数学 2014-05-15 J. F. van Diejen , E. Emsiz

We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…

数学物理 · 物理学 2020-08-26 Bertrand Duplantier , Anthony J Guttmann

We revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given $n$ points and $n$ lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line…

计算几何 · 计算机科学 2022-06-23 Timothy M. Chan , Da Wei Zheng

We establish an equivalence between infinitely many asymptotically stable periodic solutions and subsumed homoclinic connections for $N$-dimensional piecewise-linear continuous maps. These features arise as a codimension-three phenomenon.…

动力系统 · 数学 2017-04-05 David J. W. Simpson , Christopher P. Tuffley

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

计算复杂性 · 计算机科学 2011-11-10 Deepak Chermakani

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

组合数学 · 数学 2013-02-26 György Elekes , Endre Szabó

Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give…

组合数学 · 数学 2007-05-23 David Callan

We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…

数据库 · 计算机科学 2007-05-23 Georg Gottlob , Christoph Koch , Klaus U. Schulz

For many algorithmic problems on graphs of treewidth $t$, a standard dynamic programming approach gives an algorithm with time and space complexity $2^{\mathcal{O}(t)}\cdot n^{\mathcal{O}(1)}$. It turns out that when one considers the more…

数据结构与算法 · 计算机科学 2020-07-13 Jesper Nederlof , Michał Pilipczuk , Céline M. F. Swennenhuis , Karol Węgrzycki

Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…

经典分析与常微分方程 · 数学 2007-11-13 M. Alfaro , F. Marcellan , A. Pena , M. L. Rezola

Hopping parameter expansion is a useful tool to investigate heavy dynamical quarks in lattice QCD, while the range of its applicability has been sometimes questioned. We study the convergence and the valid range of the hopping parameter…

高能物理 - 格点 · 物理学 2022-03-16 Naoki Wakabayashi , Shinji Ejiri , Kazuyuki Kanaya , Masakiyo Kitazawa

Linked cluster expansions are generalized from an infinite to a finite volume. They are performed to 20th order in the expansion parameter to approach the critical region from the symmetric phase. A new criterion is proposed to distinguish…

高能物理 - 格点 · 物理学 2009-10-28 H. Meyer-Ortmanns , T. Reisz

We study the problem of adsorption and collapse transition of a linear polymer chain situated in a fractal container represented by a 4-simplex lattice and interacting with a surface adsorbed linear polymer chain. The adsorbed chain…

统计力学 · 物理学 2009-10-31 Sanjay Kumar , Yashwant Singh

We study the question of the existence of a decomposition of the diagonal for very general quartic and $(2,3)$-complete intersection $n$-folds. Using cycle-theoretic techniques of Lange, Pavic and Schreieder we reduce the question via a…

代数几何 · 数学 2025-12-11 Elia Fiammengo , Morten Lüders