English
Related papers

Related papers: Splitting loops and necklaces: Variants of the squ…

200 papers

In 1985 Hopcroft, Joseph and Whitesides showed it is NP-complete to decide whether a carpenter's ruler with segments of given positive lengths can be folded into a line of at most a given length, such that the folded hinges alternate…

Data Structures and Algorithms · Computer Science 2022-01-11 Travis Gagie , Mozhgan Saeidi , Allan Sapucaia

In this paper, we study the problem of shock reflection by a wedge, with the potential flow equation, which is a simplification of the Euler System. In the work of M. Feldman and G. Chen, the existence theory of shock reflection problems…

Analysis of PDEs · Mathematics 2021-03-31 Jingchen Hu

This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each color. Our first result states that it is possible to remove one…

Combinatorics · Mathematics 2017-06-07 Meysam Alishahi , Frédéric Meunier

This paper studies equable parallelograms whose vertices lie on the integer lattice. Using Rosenberger's Theorem on generalised Markov equations, we show that the g.c.d. of the side lengths of such parallelograms can only be 3, 4 or 5, and…

Number Theory · Mathematics 2021-05-03 Christian Aebi , Grant Cairns

We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…

Combinatorics · Mathematics 2011-01-04 Mathieu Dutour Sikirić

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

Combinatorics · Mathematics 2023-11-10 Steven Simon , Tobias Timofeyev

The rational covariance extension problem to determine a rational spectral density given a finite number of covariance lags can be seen as a matrix completion problem to construct an infinite-dimensional positive-definite Toeplitz matrix…

Optimization and Control · Mathematics 2012-08-31 Anders Lindquist , Giorgio Picci

It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…

Complex Variables · Mathematics 2021-05-21 Alexander J. Izzo , Edgar Lee Stout

We show that there always exists an inscribed square in a Jordan curve given as the union of two graphs of functions of Lipschitz constant less than $1 + \sqrt{2}$. We are motivated by Tao's result that there exists such a square in the…

Symplectic Geometry · Mathematics 2024-07-11 Joshua Evan Greene , Andrew Lobb

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

Geometric Topology · Mathematics 2019-05-06 Senja Barthel

We show that the edges of any $d$-regular graph can be almost decomposed into paths of length roughly $d$, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a…

Combinatorics · Mathematics 2024-06-05 Richard Montgomery , Alp Müyesser , Alexey Pokrovskiy , Benny Sudakov

The inverse Toeplitz eigenvalue problem (ToIEP) concerns finding a vector that specifies the real-valued symmetric Toeplitz matrix with the prescribed set of eigenvalues. Since phase "calibration" errors in uniform linear antenna arrays…

Signal Processing · Electrical Eng. & Systems 2023-05-24 Yuri Abramovich , Tanit Pongsiri

We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…

Metric Geometry · Mathematics 2021-02-23 Andrey Ryabichev

In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…

Combinatorics · Mathematics 2013-06-03 Sinisa Vrecica , Rade Zivaljevic

We prove several results concerning the theory of Toeplitz algebras over $p$-Fock spaces using a correspondence theory of translation invariant symbol and operator spaces. The most notable results are: The full Toeplitz algebra is the norm…

Functional Analysis · Mathematics 2020-06-03 Robert Fulsche

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…

Combinatorics · Mathematics 2024-02-06 Daniel W. Cranston , Jiaao Li , Zhouningxin Wang , Chunyan Wei

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

If $X$ is a subset of a Banach space with $X-X$ homogeneous, then $X$ can be embedded into some $\R^n$ (with $n$ sufficiently large) using a linear map $L$ whose inverse is Lipschitz to within logarithmic corrections. More precisely,…

Metric Geometry · Mathematics 2010-07-28 James C Robinson

A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every $k$-colored necklace can be fairly split by at most $k$…

Combinatorics · Mathematics 2014-12-30 Noga Alon , Jarosław Grytczuk , Michał Lasoń , Mateusz Michałek

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

General Mathematics · Mathematics 2009-07-27 Fu-Gao Song , Francis Austin