中文
相关论文

相关论文: Computational Geometry Column 44

200 篇论文

In 1994, Martin Gardner stated a set of questions concerning the dissection of a square or an equilateral triangle in three similar parts. Meanwhile, Gardner's questions have been generalized and some of them are already solved. In the…

度量几何 · 数学 2011-12-05 Shigeki Akiyama , Jun Luo , Ryotaro Okazaki , Wolfgang Steiner , Jörg Thuswaldner

We describe an approach to the question of finding real solutions to problems of enumerative geometry, in particular the question of whether a problem of enumerative geometry can have all of its solutions be real. We give some methods to…

alg-geom · 数学 2008-02-03 Frank Sottile

Enumerative algebraic geometry counts the solutions to certain geometric constraints. Numerical algebraic geometry determines these solutions for any given instance. This article illustrates how these two fields complement each other. Our…

代数几何 · 数学 2019-09-09 Paul Breiding , Bernd Sturmfels , Sascha Timme

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

度量几何 · 数学 2016-01-19 J. Jerónimo-Castro , E. Makai

An open question asks if every knot of 4-genus g_s can be changed into a slice knot by g_s crossing changes. A counterexample is given.

几何拓扑 · 数学 2014-10-01 Charles Livingston

The problem of construction of the surfaces with given sets of the points with horizontal tangential planes is considered. Such considerations are of interest in the problem of computer simulations of the waved ocean surfaces.

数值分析 · 数学 2011-03-02 Ivan P Smirnov , Vera G Burdukovskaya

The point-line geometry known as a \textit{partial quadrangle} (introduced by Cameron in 1975) has the property that for every point/line non-incident pair $(P,\ell)$, there is at most one line through $P$ concurrent with $\ell$. So in…

组合数学 · 数学 2012-06-26 John Bamberg , Frank De Clerck , Nicola Durante

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the…

组合数学 · 数学 2016-02-23 Peter Taylor

We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…

度量几何 · 数学 2025-06-09 Isaac Kulp , Charlotte Ochanine , Logan Richard , Leonel Robert , Scott Whitman

The Nontrivial Projection Problem asks whether every finite-dimensional normed space of dimension greater than one admits a well-bounded projection of non-trivial rank and corank or, equivalently, whether every centrally symmetric convex…

泛函分析 · 数学 2010-09-14 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

The physical consistency of the match of piecewise-$C^0$ metrics is discussed. The mathematical theory of gravitational discontinuity hypersurfaces is generalized to cover the match of regularly discontinuous metrics. The mean-value…

广义相对论与量子宇宙学 · 物理学 2008-11-26 Gianluca Gemelli

We recently conjectured a set of dualities relating two-dimensional orthogonal gauge theories with $\mathcal{N}=(4,4)$ supersymmetry, analogous to Hori's dualities with $\mathcal{N}=(2,2)$ supersymmetry. Here we provide a quantitative test…

高能物理 - 理论 · 物理学 2019-07-24 Eran Avraham , Oren Bergman

We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…

计算几何 · 计算机科学 2014-05-30 Jean Cardinal , Kolja Knauer , Piotr Micek , Torsten Ueckerdt

In this small paper we bring together various open problems on geometric multidimensional continued fractions.

数论 · 数学 2017-12-06 Oleg Karpenkov

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…

历史与综述 · 数学 2025-01-15 James M Parks

We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these…

数论 · 数学 2013-10-08 Henk Don

A relationship between two old mathematical subjects is observed: the theory of hypergeometric functions and the separability in classical mechanics. Separable potential perturbations of the integrable billiard systems and the Jacobi…

数学物理 · 物理学 2007-05-23 Vladimir Dragovic

We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and…

组合数学 · 数学 2010-04-06 Ales Drapal , Carlo Hamalainen