English
Related papers

Related papers: A Trichotomy for Rectangles Inscribed in Jordan Lo…

200 papers

We give an affirmative answer to the rectangular peg problem for a large class of continuous Jordan curves that contains all rectifiable curves and Stromquist's locally monotone curves. Our proof is based on microlocal sheaf theory and…

Symplectic Geometry · Mathematics 2026-01-06 Tomohiro Asano , Yuichi Ike

The triangle graph of a graph $G$, denoted by ${\cal T}(G)$, is the graph whose vertices represent the triangles ($K_3$ subgraphs) of $G$, and two vertices of ${\cal T}(G)$ are adjacent if and only if the corresponding triangles share an…

Combinatorics · Mathematics 2015-10-20 Aparna Lakshmanan S. , Csilla Bujtás , Zsolt Tuza

A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…

Computational Geometry · Computer Science 2025-06-10 Therese Biedl , Philipp Kindermann , Jonathan Klawitter

We prove that the closure of every Jordan class J in a semisimple simply connected complex group G at a point x with Jordan decomposition x = rv is smoothly equivalent to the union of closures of those Jordan classes in the centraliser of r…

Representation Theory · Mathematics 2020-10-12 Filippo Ambrosio , Giovanna Carnovale , Francesco Esposito

We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.

Geometric Topology · Mathematics 2019-07-03 Guillaume Tahar

A rectangle visibility graph (RVG) is represented by assigning to each vertex a rectangle in the plane with horizontal and vertical sides in such a way that edges in the graph correspond to unobstructed horizontal and vertical lines of…

Combinatorics · Mathematics 2022-08-29 John S. Caughman , Charles L. Dunn , Joshua D. Laison , Nancy Ann Neudauer , Colin L. Starr

Let $S$ be a set of $n$ points in 3-dimensional space. A tetrahedralization $\mathcal{T}$ of $S$ is a set of interior disjoint tetrahedra with vertices on $S$, not containing points of $S$ in their interior, and such that their union is the…

Computational Geometry · Computer Science 2012-10-22 Francisco Escalona , Ruy Fabila-Monroy , Jorge Urrutia

We study some properties of a triad of circles associated with a triangle. Each circle is inside the triangle, tangent to two sides of the triangle, and externally tangent to the circle on the third side as diameter. In particular, we find…

History and Overview · Mathematics 2023-11-06 Ercole Suppa , Stanley Rabinowitz

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Combinatorics · Mathematics 2022-10-28 Yanan Hu , Xingzhi Zhan , Leilei Zhang

A consequence of Rapinchuk et al. is that for $S$ a closed surface of genus $g\geq 2$, the set of Hitchin representations of $\pi_1(S)$ with image in $\mathrm{SL}(n,\mathbb{Q})$ is dense in the Hitchin component. We give a dynamical proof…

Geometric Topology · Mathematics 2025-03-28 Jacques Audibert , Michael Zshornack

Given a triangle, what is the equation of the line which bisects its area and has a given slope? The set of all lines bisecting the area of a triangle has been elegantly determined as a certain 'deltoid' envelope and this gives an indirect…

History and Overview · Mathematics 2021-01-20 Robin Whitty

The orbit polytope for a finite group G acting linearly and freely on a sphere S is used to construct a cellularized fundamental domain for the action. A resolution of the integers over G results from the associated G-equivariant…

Algebraic Topology · Mathematics 2017-10-10 Rocco Chirivi' , Mauro Spreafico

We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…

Computational Geometry · Computer Science 2020-07-21 Carlos Alegría-Galicia , David Orden , Leonidas Palios , Carlos Seara , Jorge Urrutia

Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the…

Combinatorics · Mathematics 2012-07-31 Adrian Dumitrescu , Csaba D. Tóth

Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having…

Computational Geometry · Computer Science 2015-03-18 Ahmad Biniaz , Anil Maheshwari , Michiel Smid

Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…

Number Theory · Mathematics 2019-08-16 Stephanie Chan

For the family of quadratic rational functions having a $2$-cycle of bounded type Siegel disks, we prove that each of the boundaries of these Siegel disks contains at most one critical point. In the parameter plane, we prove that the locus…

Dynamical Systems · Mathematics 2022-06-30 Yuming Fu , Fei Yang , Gaofei Zhang

Let G be the group of rational points of a connected reductive group over a finite field. Based on work of Lusztig and Yun, we make the Jordan decomposition for irreducible G-representations canonical. It comes in the form of an equivalence…

Representation Theory · Mathematics 2025-07-23 Maarten Solleveld

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

Discrete Mathematics · Computer Science 2014-04-29 Sandip Banerjee , Aritra Banik , Bhargab B. Bhattacharya , Arijit Bishnu , Soumyottam Chatterjee

In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…

Metric Geometry · Mathematics 2021-06-10 Felipe Negreira , Emiliano Sequeira
‹ Prev 1 4 5 6 7 8 10 Next ›