English
Related papers

Related papers: Squarability of rectangle arrangements

200 papers

Similarly to how the classical group ring isomorphism problem asks, for a commutative ring $R$, which information about a finite group $G$ is encoded in the group ring $RG$, the twisted group ring isomorphism problem asks which information…

Rings and Algebras · Mathematics 2021-01-06 L. Margolis , O. Schnabel

We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…

Geometric Topology · Mathematics 2021-02-19 Alan McLeay , Hugo Parlier

We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…

Data Structures and Algorithms · Computer Science 2010-01-20 Reuven Bar-Yehuda , Danny Hermelin , Dror Rawitz

In this short note, we provide the necessary and sufficient condition for an infinite collection of axis-parallel boxes in $\mathbb{R}^{d}$ to be pierceable by finitely many axis-parallel $k$-flats, where $0 \leq k < d$. We also consider…

Combinatorics · Mathematics 2024-12-13 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi

Several generalizations of a commutative ring that is a graded complete intersection are proposed for a noncommutative graded $k$-algebra; these notions are justified by examples from noncommutative invariant theory.

Rings and Algebras · Mathematics 2014-06-25 Ellen E Kirkman , James Kuzmanovich , James J. Zhang

This note shows that the hope expressed in [ADL+07]--that the new algorithm for edge-unfolding any polyhedral band without overlap might lead to an algorithm for unfolding any prismatoid without overlap--cannot be realized. A prismatoid is…

Computational Geometry · Computer Science 2007-10-04 Joseph O'Rourke

It is proved that every singular cardinal $\lambda$ admits a function $RTS:[\lambda^+]^2\rightarrow[\lambda^+]^2$ that transforms rectangles into squares. Namely, for every cofinal subsets $A,B$ of $\lambda^+$, there exists a cofinal subset…

Logic · Mathematics 2011-03-16 Assaf Rinot

We analyze surface patches with a corner that is rounded in the sense that the partial derivatives at that point are antiparallel. Sufficient conditions for $G^1$ smoothness are given, which, up to a certain degenerate case, are also…

Computational Geometry · Computer Science 2022-11-18 Benjamin Marussig , Ulrich Reif

Miniversal deformations for pairs of skew-symmetric matrices under congruence are constructed. To be precise, for each such a pair $(A,B)$ we provide a normal form with a minimal number of independent parameters to which all pairs of…

Representation Theory · Mathematics 2016-06-13 Andrii Dmytryshyn

Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a partition into disjoint colourings, we speak of a packing.…

Combinatorics · Mathematics 2024-12-06 Stijn Cambie , Rimma Hämäläinen

Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…

Geometric Topology · Mathematics 2022-07-25 Hiroki Ito , Seiichi Kamada

Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…

Combinatorics · Mathematics 2026-04-29 Robert Barish , Hoi Ping Luk , Min Yan

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec

We investigate equidecomposability in the ring of polygons with sides restricted to given directions and using only translations. Extending classical results of Dehn and Hadwiger, we prove that equidecomposability in these rings is…

Metric Geometry · Mathematics 2025-07-14 Gergely Kiss , Miklós Laczkovich

The most general form of non-static plane symmetric space-times is considered to study proper curvature collineations by using the rank of the 6X6 Riemann matrix and direct integration techniques. Studying proper curvature collineations in…

Mathematical Physics · Physics 2015-12-23 Ghulam Shabbir , M. Ramzan

How can a stack of identical blocks be arranged to extend beyond the edge of a table as far as possible? We consider a generalization of this classic puzzle to blocks that differ in width and mass. Despite the seemingly simple premise, we…

Combinatorics · Mathematics 2026-02-13 Simon Gmeiner , Andreas S. Schulz

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…

Algebraic Geometry · Mathematics 2018-05-04 E. Artal , J. Carmona , J. I. Cogolludo , M. A. Marco

In this paper, we introduce the notion of circular orderability for quandles. We show that the set all right (respectively left) circular orderings of a quandle is a compact topological space. We also show that the space of right…

Geometric Topology · Mathematics 2022-04-21 Idrissa Ba , Mohamed Elhamdadi

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

Combinatorics · Mathematics 2016-07-08 Bill Jackson , Viktoria Kaszanitzky , Anthony Nixon

Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…

Computational Geometry · Computer Science 2015-03-17 Vida Dujmovic , Stefan Langerman