Tagged Questions

The tag has no wiki summary.

learn more… | top users | synonyms

4
votes
1answer
244 views

Are angles between points enough to decide the realizability?

Let n points in the plane be given whose coordinates we don't know. Assume, however, that for any triple of the points we know the angle. Question: Can we decide whether the n points are realizable ...
3
votes
2answers
187 views

A problem on chains of squares — can one find an easy combinatorial proof?

Consider the unit square $ S = [0,1] \times [0,1] $. For each $ n \in \mathbb{N} $, we can tessellate $ S $ by the collection $$ A = \left\{ \left[ \frac{i}{n},\frac{i + 1}{n} \right] \times ...
3
votes
1answer
82 views

Points with pairwise integer distances in the plane

Consider $n>3$ points with pairwise integer distances in the plane! What is the relationship between these $n(n-1)/2$ integers? Do we have a theorem or result about these points? Does there exist a ...
2
votes
0answers
139 views

Dissection of a polygon into convex polygons

Problem: for a fixed integer $m\geqslant 3$ find all $n$ such that no $n$-gon can be dissected into convex $m$-gons. I would be very grateful for any information on this problem. Remark 1. There ...
4
votes
2answers
103 views

(non-)existence of the aperiodic monotile

The aperiodic monotile problem asks whether there exists a single tile that every tiling made with it results non-periodic. What is known about this problem? If this tile exists, how can it be/not be? ...
7
votes
1answer
133 views

How many maximal triangulations of a rectangle?

I posted the following question on MathStackExchange, but I didn't any answer. So please let me post it on MathOverflow. Let $L_{m,n}\subset\mathbb R^2$ be a rectangle given by $[0,m]×[0,n]$ with ...
27
votes
2answers
536 views

what-if.xkcd.com: stabbing (simply connected) regions on the 2-sphere with few geodesics

In the latest what-if Randall Munroe ask for the smallest number of geodesics that intersect all regions of a map. The following shows that five paths of satellites suffice to cover the 50 states of ...
22
votes
2answers
543 views

Random points on the unit sphere

Suppose you have $n$ points picked uniformly at random on the surface of $\mathbb{S}^d,$ and let the volume of the convex hull of these points be $V_{n, d}.$ Clearly, $V_{n, d}$ converges to the ...
6
votes
2answers
178 views

Pictures of the von Neumann polytope

Are there any graphic portrayals of von Neumann polytopes in low dimensions?
6
votes
1answer
328 views

Groups and pregeometries

Definition. For an infinite structure $\mathcal{A}$ and $cl : P(dom(\mathcal{A})) \longrightarrow P(dom(\mathcal{A}))$ , we say that $(\mathcal{A}, cl)$ is a structure carrying an $\omega$-homogeneous ...
2
votes
1answer
104 views

Distance from constant width bodies

EDIT As @David has observed, my conjecture was clearly wrong for $\ n:=2.\ $ Let me still give it a chance for $\ n\ge 3$. I'll call a family $\ F\ $ of bound closed convex subsets of $\ \mathbb ...
0
votes
0answers
112 views

“Open Points” in the 1983 proof of Szemerédi-Trotter theorem

I was reading through the 1983 paper "Extremal Problems in Discrete Geometry" and I was confused about the definition of "open point" appearing in this paper. By this point in the paper, the authors ...
7
votes
1answer
91 views

Dropping altitudes to achieve nonobtuse planar triangulations: finite or infinite?

Given a planar triangulation of (say) a convex region, imagine the following process to convert it to a triangulation with no obtuse angles: Pick an arbitrary obtuse angle at vertex $a$ of ...
1
vote
1answer
142 views

Is there a “Bipartite” Szemeredi-Trotter theorem?

One version of the Szemeredi-Trotter theorem states the following: Given a set of $L$ lines in the plane, the number of points incident to at least $k$ lines is bounded above by a constant times $L/k ...
2
votes
2answers
108 views

Maximum possible number of similar three-colored triangles

I want to maximize the number of similar triangles with vertices from three fixed sets, one vertex from each set. For example, if you fix two points $X$, $Y$ (i.e. two sets with only one member), then ...
5
votes
2answers
231 views

Put P inside Q! polygons/polyhedra

We have two Polygons/Polyhedra P and Q. Does there exist a polynomial time algorithm to decide if we can put P (using translation and rotation) inside Q or not? First think about the case of which P ...
10
votes
2answers
472 views

Cut and Fold Polyhedron!

I have two convex polyhedra such that their sums of side areas are equal. It is true that I can cut one of them and flatten it on the plane, then fold the flattened polygon to reach the other ...
5
votes
1answer
192 views

Small remarkable matroids

Working on phased matroids (a generalization of oriented matroid to the complex case) I've found an interesting formula for computing the inner Tutte group (and, hence, all the Tutte groups) ...
1
vote
0answers
32 views

Generalizing Concepts of Planar Euclidean Geometry to Symmetric TSP-Instances

To me it seems possible, to successfully look at symmetric TSP instances from a geometry-point of view. Examples are: the diagonals of the convex hull of a set of points in the euclidean plane; ...
2
votes
1answer
128 views

intersection of the unit cube and a hyperplane containing the main diagonal

Let $A$ be a linear $m$-dimensional subspace of $\mathbf{R}^n$ $m < n$, containing the point $(1,1,\ldots,1) \in \mathbf{R}^n$, and consider the intersection of $A$ and the unit cube $\Delta_n$ ...
0
votes
0answers
63 views

Toric morphism fiber and kernel dimensions

Given a morphism between two smooth toric varieties $f: X \rightarrow Y$, is the dimension of the kernel of $\mathrm{d}f$ at any point $p \in X$ equal to the dimension of the fiber at $f(p) \in Y$? ...
11
votes
2answers
296 views

When does a set of collinearity conditions imply collinearity of all of the points?

Suppose we have a set of $n$ points $\{X_1,X_2,\dots,X_n\}$ in the real plane and $\mathcal{A}$ a family of subsets of $\{1,\dots,n\}$. By a "set of collinearity conditions for $\mathcal{A}$" we mean ...
1
vote
1answer
164 views

Positroids and Totally Nonnegative Complex Grassmanian

Recently I begin working on matroids, in particular to a generalization of oriented matroids to the complex case. I found on arxiv the following interesting articles: 1)Alexander Postnikov: Total ...
4
votes
1answer
177 views

Light inside a polyhedron

I have two questions the same as Mostafa's Question: Visibility of vertices in polyhedra Suppose $P$ is a closed polyhedron in space (i.e. a union of polygons which is homeomorphic to $S^2$) and $X$ ...
19
votes
3answers
774 views

Visibility of vertices in polyhedra

Suppose $P$ is a closed polyhedron in space (i.e. a union of polygons which is homeomorphic to $S^2$) and $X$ is an interior point of $P$. Is it true that $X$ can see at least one vertex of $P$? More ...
3
votes
1answer
101 views

Polygonal Venn diagrams

Suppose that the interiors of $n$ $m$-sided planar simple closed polygons generate a $\sigma$-algebra $A$. How many atoms can $A$ possess, at the most? Failing an exact answer, how about good ...
7
votes
2answers
119 views

Uniqueness of an equilateral triangle decomposition into three similar polygons, exactly two congruent

A favorite fun problem I give to students and (even non-mathematical) friends is the following: Find a decomposition of an equilateral triangle into three similar polygons, exactly two of which are ...
12
votes
3answers
589 views

Is {6,3,7} an 'ultrahyperbolic' Coxeter group?

These pictures, drawn by Roice Nelson, are attempts to visualize a geometry having as symmetries the {6,3,7} Coxeter group, by which I mean the one coming from the Coxeter diagram ...
1
vote
0answers
84 views

What is the projective dual of a planar graph?

Everybody learns the usual definition of the dual of a planar graph when edges are preserved and faces are mapped to vertices. Everybody learns the projective duality. What if we apply it to a ...
6
votes
1answer
303 views

Triangle (constrained number, rather than shape) packing?

Are there any interesting results on optimal packings in the plane using a fixed number of triangles (without a fixed size or shape constraint)? For instance, what's the maximum area packing of the ...
0
votes
0answers
108 views

Generalized Sphere Kissing Problem

I am currently researching discrete geometry and I am in need of an upper bound on a generalized kissing number in 3-dimensions dependent upon a parameter $\eta$ which is the radii of spheres touching ...
2
votes
1answer
98 views

Relation between non-integral polytopes, integrally closed polytopes and polynomial Erhart quasi-polynomials

By lattice points, I will always mean points in $\mathbb{Z}^n$ and all polytopes here are convex rational polytopes. If $P$ is an integral polytope, the counting function for the number of lattice ...
4
votes
5answers
431 views

Lattice points in dilated polytopes and sumsets

Let $P$ be an integral polytope, that is, the convex hull of some points in $\mathbb{N}^d$. Let $p_1,\dots,p_m$ be all lattice points in $P$. Question: What is the condition on $P$ that guarantees ...
1
vote
0answers
70 views

Separating unit disks by circles

This is inspired by the recent question about separating unit disks by lines, which I will refer to as the "line case". Replacing "line" by "circle" adds one degree of freedom, and I'm wondering if ...
7
votes
1answer
232 views

Separating unit disks by lines

Given $n\ge 2$. For a real $d>2$, consider a constellation $C$ of $2n$ disks of radius $1$ in the plane such that $h(C)$, the minimal distance between any two of their centers, is equal to $d$. Let ...
1
vote
0answers
92 views

On 'Very Movable' Geometric Configurations (Configurations with a large degree of freedom)

Let $C$ be an $(n_r, b_k)$ combinatorial configuration that admits a geometric realization in the plane. I'm interested in the maximum number of points/lines $M$ of $C$ we can place in general ...
32
votes
0answers
478 views

Extending a line-arrangement so that the bounded components of its complement are triangles

Given a finite collection of lines $L_1,\dots,L_m$ in ${\bf{R}}^2$, let $R_1,\dots,R_n$ be the connected components of ${\bf{R}}^2 \setminus (L_1 \cup \dots \cup L_m)$, and say that {$L_1,\dots,L_m$} ...
3
votes
0answers
483 views

How many combinations does Android pattern have? [closed]

Rules- 1) At-least 4 and at-max 9 dots must be connected. 2) There can be no jumps 3) Once a dot is crossed, you can jump over it.
2
votes
0answers
37 views

How many regions are created by the set of all hyperplanes defined by a set of points?

If we have a set of points X in d-dimensional euclidean space, and we look at the set of all hyperplanes that are defined by any subset Y of X (in the sense of being the unique hyperplane containing ...
1
vote
0answers
103 views

intersection points and lines, part two

Two years ago I asked a question about finding couples of integers (p,l) such that one may draw l lines on the euclidean plane, creating exactly p intersection points, and I got very interesting ...
5
votes
1answer
225 views

Regular lattice polygons

Suppose I want to construct an $N$-gon in the plane whose vertices are integer lattice points, and which is close to a regular $N$-gon (which means, the ratio of longest to the shortest side is within ...
6
votes
1answer
111 views

How “accidental” are equalities between parts of Ehrhart quasi-polynomials? When do they persist to Euler-Maclaurin?

Background What I think of Ehrhart theory (http://en.wikipedia.org/wiki/Ehrhart_polynomial) asserts that if we take a lattice polytope $P$, and count the number of lattice points in the $t$th ...
0
votes
1answer
161 views

Expected length of the shortest polygonal chain connecting N random points in the unit square

N points are selected uniformly at random in the unit square. Let L(N) be the expected length of the shortest (possibly self-intersecting) polygonal chain connecting all the points. It can be proved ...
7
votes
0answers
101 views

Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between edges are rational multiples of $\pi$?

After reading these very interesting questions, I came up with another one: Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between all pairs of edges meeting ...
6
votes
0answers
74 views

Constructing a polyhedron of maximal possible volume from given bounds on areas of its faces

Consider $n$ variables $a_1,...,a_n$ ranging over $\mathbb{R}^+$. Suppose we are given $n$ pairs of positive rational numbers $(p_1,q_1),...,(p_n,q_n)$ where each pair imposes bounds on the ...
4
votes
0answers
222 views

Unique Domino Tiling

Question: how does one enumerate all star-convex $2n$-vertex sublattices of the plane that have the unique domino-tiling property? Definitions: A subset S of the xy-plane is star-convex if there is ...
2
votes
2answers
274 views

Sphere - Symmetry and Triangulation [closed]

The sphere is symmetric with respect to any rotation. However, it loses this property as soon as it is triangulated. Are there sequences of triangulations that possess particular large symmetry groups ...
2
votes
1answer
283 views

Number of 3-tuple partitions of a multiple of three which follow the triangle inequality

Given n=3t, t$\in \mathbb N$; let $\mathbb L_3$ be set of all distinct integer partitions of n having 3 parts; say $\lambda_1,\lambda_2,\lambda_3$ . If I chose any one partition randomly from ...
1
vote
1answer
76 views

Softwares to draw euclidean polyhedral surfaces

Let $S$ be an abstract euclidean polyhedral surface. By this, I mean a orientable compact 2D topological surface obtained by gluing together some (convex) euclidean polygons (arbitrary genus). ...
5
votes
1answer
282 views

What are the essential properties of algebraic closure on an arbitrary structure?

Define the "model theoretic" notion of a closure function as follows: Definition (1): Let $D$ be a non-empty set. A function $cl:P(D)\longrightarrow P(D)$ called a closure function iff it has the ...