English
Related papers

Related papers: An Infinite, Converging, Sequence of Brocard Poris…

200 papers

We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…

Dynamical Systems · Mathematics 2017-08-25 Bruno Rodrigues de Freitas , João Carlos Medrado

For every odd prime number p, we give examples of non-constant smooth families of genus 2 curves over fields of characteristic p which have pro-Galois (pro-\'etale) covers of infinite degree with geometrically connected fibers. The…

Algebraic Geometry · Mathematics 2009-05-18 Claus Diem , Gerhard Frey

We define a simplicial category called the category of derived manifolds. It contains the category of smooth manifolds as a full discrete subcategory, and it is closed under taking arbitrary intersections in a manifold. A derived manifold…

Algebraic Topology · Mathematics 2019-12-19 David I. Spivak

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…

Probability · Mathematics 2011-01-10 Pieter Trapman

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Combinatorics · Mathematics 2018-02-28 Daniele D'Angeli , Alfredo Donno

We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…

Statistical Mechanics · Physics 2015-08-05 Youjin Deng , Jesper Lykke Jacobsen , Xuan-Wen Liu

A two-dimensional simplicial complex is called $d$-{\em regular} if every edge of it is contained in exactly $d$ distinct triangles. It is called $\epsilon$-expanding if its up-down two-dimensional random walk has a normalized maximal…

Combinatorics · Mathematics 2020-04-27 Eyal Karni , Tali Kaufman

The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…

Mathematical Physics · Physics 2026-05-29 Malo Hillairet

We compute the involutive Heegaard Floer homology of the family of three-manifolds obtained by plumbings along almost-rational graphs. (This includes all Seifert fibered homology spheres.) We also study the involutive Heegaard Floer…

Geometric Topology · Mathematics 2024-08-27 Irving Dai , Ciprian Manolescu

We prove that Lagrangian cocores and Lagrangian linking disks of a stopped Weinstein manifold generate the Lagrangian cobordism infinity-category. As a geometric consequence, we see that any brane (after stabilization) admits a Lagrangian…

Symplectic Geometry · Mathematics 2020-04-28 Hiro Lee Tanaka

This technical note analyzes the properties of a random sequence of prolate hyperspheroids with common foci. Each prolate hyperspheroid in the sequence is defined by a sample drawn randomly from the previous volume such that the sample lies…

Statistics Theory · Mathematics 2014-04-01 Jonathan D. Gammell , Siddhartha S. Srinivasa , Timothy D. Barfoot

There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…

Combinatorics · Mathematics 2021-06-08 Kieran Clancy , Michael Haythorpe , Alex Newcombe

It is well known that baby Mandelbrot sets are homeomorphic to the original one. We study baby Tricorns appearing in the Tricorn, which is the connectedness locus of quadratic anti-holomorphic polynomials, and show that the dynamically…

Dynamical Systems · Mathematics 2021-08-23 Hiroyuki Inou , Sabyasachi Mukherjee

Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…

Combinatorics · Mathematics 2017-05-02 Attila Joó

We define the bounded coarse structure attached to a family of pseudometrics and give some counterexamples to conjectures that arise naturally.

General Topology · Mathematics 2014-10-14 Jesús P. Moreno-Damas

We give an infinite family of knots such that for any given $r \geq 3$, the family contains a knot which can be embedded on a hexagonal $r$-mosaic, but cannot fit on a hexagonal $r$-mosaic in an embedding that achieves its crossing number.…

Geometric Topology · Mathematics 2026-04-20 Hugh Howards , Jiong Li , Xiaotian Liu , Anna Paulec

It is well-known that in any codimension a simply connected Euclidean minimal surface has an associated one-parameter family of minimal isometric deformations. In this paper, we show that this is just a special case of the associated family…

Differential Geometry · Mathematics 2015-02-17 Marcos Dajczer , Theodoros Vlachos

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

Combinatorics · Mathematics 2019-03-19 Drago Bokal , Mojca Bračič , Marek Derňár , Petr Hliněný

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz