Related papers: Large Shadows from Sparse Inequalities
Suppose a d-dimensional lattice cube of size n^d is colored in several colors so that no face of its triangulation (subdivision of the standard partition into n^d small cubes) is colored in m+2 colors. Then one color is used at least…
If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently…
Consider a hypergraph $H_n^d$ where the vertices are points of the $d$-dimensional combinatorial cube $n^d$ and the edges are all sets of $n$ points such that they are in one line. We study the structure of the group of automorphisms of…
Shadows of multi-black holes have structures distinct from the mere superposition of the shadow of a single black hole: the eyebrow-like structures outside the main shadows and the deformation of the shadows. We present analytic estimates…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
It is proved that if we partition a $d$-dimensional cube into $n^d$ small cubes and color the small cubes into $m+1$ colors then there exists a monochromatic connected component consisting of at least $f(d, m) n^{d-m}$ small cubes.
We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Color Condition is satisfied. Given a palette of six colors,…
The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the $d$-dimensional unit cube $[0,1]^d$. The figures of merit are three different variants of $L_2$ discrepancy. Theoretical results…
A shadow of a geometric object $A$ in a given direction $v$ is the orthogonal projection of $A$ on the hyperplane orthogonal to $v$. We show that any topological embedding of a circle into Euclidean $d$-space can have at most two shadows…
We investigate the existence of metric spaces which, for any coloring with a fixed number of colors, contain monochromatic isomorphic copies of a fixed starting space K. In the main theorem we construct such a space of size \(2^{\aleph_0}\)…
The paper is focused on the four-dimensional visualization of hypersurfaces represented by implicit equations without their parametrization. We describe a general method to find shadow boundaries in an arbitrary dimension and apply it in a…
We consider the space $[0,n]^3$, imagined as a three dimensional, axis-aligned grid world partitioned into $n^3$ $1\times 1 \times 1$ unit cubes. Each cube is either considered to be empty, in which case a line of sight can pass through it,…
We show that the d-cube is determined by the spectrum of its distance matrix.
A vertex 2-coloring of a graph is said to be perfect with parameters $(a_{ij})_{i,j=1}^k$ if for every $i,j\in\{1,...,k\}$ every vertex of color $i$ is adjacent with exactly $a_{ij}$ vertices of color $j$. We consider the perfect…
In this paper, we study the following two hypercube coloring problems: Given $n$ and $d$, find the minimum number of colors, denoted as ${\chi}'_{d}(n)$ (resp. ${\chi}_{d}(n)$), needed to color the vertices of the $n$-cube such that any two…
We study the shadow behaviors of five dimensional (5D) black holes embedded in type IIB superstring/supergravity inspired spacetimes by considering solutions with and without rotations. Geometrical properties as shapes and sizes are…
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…
We study the quantization of the 6d Seiberg-Witten curve for D-type minimal conformal matter theories compactified on a two-torus. The quantized 6d curve turns out to be a difference equation established via introducing codimension two and…