The tag has no wiki summary.

learn more… | top users | synonyms

2
votes
1answer
70 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 ...
0
votes
0answers
88 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 ...
4
votes
5answers
388 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 ...
25
votes
3answers
2k views

Is the ratio Perimeter/Area for a finite union of unit squares at most 4?

Update: As I have just learned, this is called Keleti's perimeter area conjecture. Prove that if H is the union of a finite number of unit squares in the plane, then the ratio of the perimeter and ...
9
votes
1answer
251 views

Maximum number of Vertices of Hypercube covered by Ball of radius R

Let $R>0$ be given and let $H^n$ be the unit hypercube in $\mathbb{R}^n$. The problem I am facing is to find the maximum number of vertices of $H^n$ which can be covered by a closed $n$-dimensional ...
6
votes
1answer
95 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 ...
19
votes
1answer
443 views

Voronoi cell of lattices with the same profile

Definition 1. Given a body $V$ in $\mathbb R^n$, the function $p_V\colon \mathbb R_+\to \mathbb R_+$ $$p_V(r)=\mathop{\rm vol} [V\cap B_r(0)]$$ will be called profile of $V$. Definition 2. Define ...
1
vote
0answers
64 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 ...
31
votes
0answers
418 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$} ...
7
votes
1answer
214 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
80 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 ...
3
votes
0answers
195 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
33 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 ...
11
votes
3answers
1k views

When are Ehrhart functions of compact convex sets polynomials?

Given a lattice $L$ and a subset $P\subset \mathbb R^d$, we define for each positive integer $t$ $$f_P(L,t)=|(tP\cap L)|$$ the number of lattice points in $tP$. Let's say $P$ is nice if $f_P(L,t)$ is ...
1
vote
0answers
98 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 ...
4
votes
2answers
176 views

Generators of a 2D lattice

Dear MO_World, I'm hoping someone can point me towards a reference for something. I have an invertible $2\times 2$ matrix, $A$, with real entries such that for both of the rows, the entries are ...
5
votes
1answer
207 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 ...
0
votes
1answer
146 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 ...
15
votes
1answer
308 views

Does every convex polyhedron have a combinatorially isomorphic counterpart whose all faces have rational areas?

Does every convex polyhedron have a combinatorially isomorphic counterpart whose faces all have rational areas? Does every convex polyhedron have a combinatorially isomorphic counterpart whose edges ...
6
votes
0answers
83 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
61 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
143 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 ...
3
votes
1answer
265 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 ...
3
votes
0answers
200 views

Tiling a rectangle with weighted cells (min-max problem)

I have been struggling with a research problem. The problem can be formalized as follows: Given a $n\times m$ matrix $A$ containing cells with non-negative integer values, partition it in $J$ ...
29
votes
4answers
1k views

Tiling A Rectangle With A Hint of Magic

Here's a a famous problem: If a rectangle $R$ is tiled by rectangles $T_i$ each of which has at least one integer sidelength, then the tiled rectangle $R$ has at least one integer side length. ...
2
votes
2answers
240 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 ...
13
votes
2answers
1k views

How many vertices/edges/faces at most for a convex polyhedron that tiles space?

I wonder if this problem has already been examined before: Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have? ...
5
votes
1answer
285 views

The Cayley Menger Theorem and integer matrices with row sum 2

I just filled a gap in my education by learning about the Cayley-Menger theorem, and the Cayley-Menger determinant: If $P_0, \dots, P_n$ are $n+1$ point in $\mathbb{R}^n$, and $d_{i,j} = |P_i - P_j|$ ...
6
votes
1answer
243 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 ...
1
vote
1answer
72 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
130 views

Curvature flows for PL closed curves in the plane?

I'm curious to what extent people have studied "curvature flows" on PL closed curves in the plane. There's a paper by Gage and Hamilton from 1986 that describes the long-term behaviour of smooth ...
1
vote
0answers
73 views

Group actions on polytopes in indefinite integer lattices

Is anything at all known about polytopes in indefinite integer lattices? I'm interested in lattice automorphisms which preserve certain polytopes of "high regularity" (e.g. cones). As a first step, ...
7
votes
1answer
174 views

Largest convex hull of a unit length path

What is the largest area possible for the convex hull of a path of unit length lying on a plane? For what paths is that largest area attained?
2
votes
1answer
79 views

Estimates on the number of vertices of reflexive polytopes

Suppose $M \cong \mathbb{Z}^n$ is a rank $n$ lattice, with dual lattice $N$. Suppose $\Delta$ is a full dimensional lattice polytope (i.e. convex hull of finite lattice points) in $M$. Then $\Delta$ ...
1
vote
1answer
207 views

Rational points of non-rational curves

An algebraic curve (in this question) is the zero set   $C = f^{-1}(X\ Y)$ of any polynomial   $f\in\mathbb R[X\ Y]$;   we say then that   $f$   represents   $C$.   ...
1
vote
0answers
217 views

A problem in Galois Geometry

Given a prime $p$, out of $N$ vectors of length $p^k$ over $\Bbb F_2$ of Hamming weight $w^{k}$ that are chosen, how many vectors can there be with pairwise Hamming distance at least $2w^{k}$ given ...
11
votes
3answers
368 views

Is there a nice way to “unravel” a great dodecahedron?

The great dodecahedron is a non-convex regular polyhedron bounded by 12 pentagonal faces, crossing each other, arranged in a star-shaped manner around each of its 12 vertices (see the Wikipedia page ...
11
votes
0answers
359 views

Hrushovski's Construction

Zilber expressed a conjecture for $\aleph_{1}$- categorical theories.(In 80s) Zilber's Conjecture: The geometry of any $\aleph_{1}$- categorical structure is one of the following: a) Trivial (No ...
2
votes
1answer
117 views

Realizability of extensions of a free oriented matroid by an independent set

Question: I am searching for a non-realizable matroid with few dependencies relative to the number of points. Precisely, I would like to find a non-realizable (over $\mathbb{R}$) oriented matroid $M$ ...
2
votes
0answers
296 views

Partitioning the Projective Plane

Throughout this post, by projective plane I mean the set of all lines through the origin in $\mathbb{R}^3$. Side Note: If there are more standard definitions for any of the ideas presented here, ...
2
votes
2answers
161 views

Three questions concerning lattice points on sphere surfaces

Pardon my ignorance of this topic. Q1. In which dimensions $d$ is it the case that, for every natural number $n$, there exists a sphere having exactly $n$ lattice points on it ...
22
votes
3answers
950 views

Can one recover the smooth Gauss Bonnet theorem from the combinatorial Gauss Bonnet theorem as an appropriate limit?

First let me state two known theorems. Theorem 1 (for smooth manifolds): Let $(M,g)$ be a smooth compact two dimensional Riemannian manifold. Then $$ \int \frac{K}{2 \pi} dA = \chi (M) $$ where $K$ ...
7
votes
2answers
336 views

Two cubes in unit cube

A cube of side one contains two cubes of sides a and b having non-overlapping interiors. How to prove the inequality $a+b \le 1$? The same question in higher dimensions. It was asked, but not answered ...
3
votes
2answers
227 views

Problems similar to Borsuk’s Theorem in the plane

Consider a 2-dimensional Borsuk's theorem: Every bounded set $S$ in the plane can be partitioned into three parts with diameter smaller than the diameter of $S$. I wonder if there are any ...
5
votes
1answer
435 views

Difference Sets

Suppose $$ P \subseteq \{1,2,\dots,N\},\quad |P| = K $$ We calculate the differences as: $$d=p_i-p_j\mod N,\quad i\ne j$$ Now let $a_d$ denote the number of occurrence of $d$ (for $d = 1, 2, \dots , N ...
2
votes
2answers
137 views

Proving non-convexity of a set of lattice points

I have a set of lattice points S in R^n (listed in memory in a computer for n=8 say). I want to computationally certify that they do not form the lattice points of a convex polytope P in R^n. (Ex. ...
4
votes
2answers
414 views

On the joints problem in finite fields

The original version of the so-called "joints problem" consists of the following: Let $L$ be a set of lines in $\mathbb{R}^{3}$. Determine the maximum number of "joints" determined by these lines, ...
1
vote
0answers
138 views

Lattice-point enumeration question involving linear combinations of matrices

I would like to know some references to learn more about an answer to this question, if there are any references: Let $A_1, \dots , A_m$ and $B$ be $n\times n$ symmetric matrices. Let $$S = \{(x_1, ...
9
votes
1answer
212 views

Which values can attain the minimum solid angle in a simplex

Given a simplex $S$ with a vertex $v$ by the solid angle at this vertex I mean the value $\hbox{vol}(B \cap S)/\hbox{vol}(B)$ where $B$ is a small enough ball centered at $v$ (for example, in the ...
19
votes
8answers
1k views

Higher-dimensional Catalan numbers?

One could imagine defining various notions of higher-dimensional Catalan numbers, by generalizing objects they count. For example, because the Catalan numbers count the triangulations of convex ...