English
Related papers

Related papers: Visibility phenomena in hypercubes

200 papers

The collection of all topologies on the set of three points is studied treating the topology as quantum-like observable. It turns out to be possible under the assumption of the asymmetry between the spaces of bra- and ket-vectors. The…

General Relativity and Quantum Cosmology · Physics 2009-10-28 A. A. Grib , R. R. Zapatrin

To every $n$-dimensional lens space $L$, we associate a congruence lattice $\mathcal L$ in $\mathbb Z^m$, with $n=2m-1$ and we prove a formula relating the multiplicities of Hodge-Laplace eigenvalues on $L$ with the number of lattice…

Differential Geometry · Mathematics 2016-07-20 Emilio A. Lauret , Roberto J. Miatello , Juan Pablo Rossetti

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

Number Theory · Mathematics 2013-04-30 Fabrizio Barroero , Martin Widmer

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

Number Theory · Mathematics 2016-04-01 Victor Beresnevich

A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…

Combinatorics · Mathematics 2025-10-14 Antoine Deza , Zhongyuan Liu , Lionel Pournin

In 2021, Hibi et. al. studied lattice points in $\mathbb{N}^2$ that appear as $(\depth R/I,\dim R/I)$ when $I$ is the edge ideal of a graph on $n$ vertices, and showed these points lie between two convex polytopes. When restricting to the…

Commutative Algebra · Mathematics 2024-03-06 Sara Faridi , Iresha Madduwe Hewalage

It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or…

Logic · Mathematics 2016-08-16 Luck Darnière

The work deals with the existence of solutions of a certain system of quadratic integral equations in H^2(R^d,R^N), d = 2, 3. We demonstrate the existence of a perturbed solution by virtue of a fixed point technique.

Analysis of PDEs · Mathematics 2025-06-19 Vitali Vougalter

The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…

Number Theory · Mathematics 2026-01-26 Chahat Ahuja

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Metric Geometry · Mathematics 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7,…

Combinatorics · Mathematics 2015-05-15 Michel Deza , Mathieu Dutour Sikiric

A visibility representation of a graph $G$ is an assignment of the vertices of $G$ to geometric objects such that vertices are adjacent if and only if their corresponding objects are "visible" each other, that is, there is an uninterrupted…

Combinatorics · Mathematics 2016-09-06 Eric Peterson , Paul S. Wenger

We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…

Metric Geometry · Mathematics 2016-06-23 Daniel Dadush , Oded Regev

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…

Number Theory · Mathematics 2013-08-19 Lenny Fukshansky , Glenn Henshaw

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

Given any rectangular polyhedron 3-manifold $P$ tiled with unit cubes, we find infinitely many explicit directions related to cubic algebraic numbers such that all half-infinite geodesics in these directions are uniformly distributed in…

Number Theory · Mathematics 2022-05-18 Jozsef Beck , William Chen

The set of primitive vectors on large spheres in the euclidean space of dimension d>2 equidistribute when projected on the unit sphere. We consider here a refinement of this problem concerning the direction of the vector together with the…

Number Theory · Mathematics 2017-05-17 Menny Aka , Manfred Einsiedler , Uri Shapira

Consider the $d$-dimensional hyperbolic space $\mathbb{M}_K^d$ of constant curvature $K<0$ and fix a point $o$ playing the role of an origin. Let $\mathbf{L}$ be a uniform random $q$-dimensional totally geodesic submanifold (called…

Probability · Mathematics 2025-07-01 Ercan Sönmez , Panagiotis Spanos , Christoph Thäle

We examine several types of visibility graphs in which sightlines can pass through $k$ objects. For $k \geq 1$ we bound the maximum thickness of semi-bar $k$-visibility graphs between $\lceil \frac{2}{3} (k + 1) \rceil$ and $2k$. In…

Combinatorics · Mathematics 2014-11-14 Matthew Babbitt , J. T. Geneson , Tanya Khovanova
‹ Prev 1 8 9 10 Next ›