English
Related papers

Related papers: Lattice Points in Large Borel Sets and Successive …

200 papers

The goal of this paper is to explicitly describe a minimal binomial generating set of a class of lattice ideals, namely the ideal of certain Veronese $3$-fold projections. More precisely, for any integer $d\ge 4$ and any $d$-th root $e$ of…

Algebraic Geometry · Mathematics 2019-05-08 Liena Colarte Gómez , Rosa Maria Miró-Roig

Let ||.|| be a norm in R^d whose unit ball is B. Assume that V\subset B is a finite set of cardinality n, with \sum_{v \in V} v=0. We show that for every integer k with 0 \le k \le n, there exists a subset U of V consisting of k elements…

Metric Geometry · Mathematics 2020-12-04 Gergely Ambrus , Imre Barany , Victor Grinberg

Let $P_1, P_2,\ldots, P_{d+1}$ be pairwise disjoint $n$-element point sets in general position in $d$-space. It is shown that there exist a point $O$ and suitable subsets $Q_i\subseteq P_i \; (i=1, 2, \ldots, d+1)$ such that $|Q_i|\geq…

Combinatorics · Mathematics 2016-09-06 János Pach

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

Combinatorics · Mathematics 2015-10-20 Roland Bacher

We prove that if $\phi: {\Bbb R}^d \times {\Bbb R}^d \to {\Bbb R}$, $d \ge 2$, is a homogeneous function, smooth away from the origin and having non-zero Monge-Ampere determinant away from the origin, then $$ R^{-d} # \{(n,m) \in {\Bbb Z}^d…

Classical Analysis and ODEs · Mathematics 2011-03-15 Alex Iosevich , Krystal Taylor

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…

Number Theory · Mathematics 2022-04-08 Jayadev S. Athreya , Cristian Cobeli , Alexandru Zaharescu

An old result of Zamfirescu says that for most convex curves $C$ in the plane most points in $R^2$ lie on infinitely many normals to $C$, where most is meant in Baire category sense. We strengthen this result by showing that `infinitely…

Metric Geometry · Mathematics 2014-03-04 Imre Bárány , Miklós Laczkovich

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…

Algebraic Geometry · Mathematics 2024-11-18 Edoardo Ballico , Maria Chiara Brambilla

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

Rings and Algebras · Mathematics 2024-07-08 Amartya Goswami

A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…

alg-geom · Mathematics 2008-02-03 Sacha Sardo-Infirri

A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…

Functional Analysis · Mathematics 2022-08-24 Marcel de Jeu , Jan Harm van der Walt

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

This study investigates the existence of tuples $(k, \ell, m)$ of integers such that all of $k$, $\ell$, $m$, $k+\ell$, $\ell+m$, $m+k$, $k+\ell+m$ belong to $S(\alpha)$, where $S(\alpha)$ is the set of all integers of the form $\lfloor…

Number Theory · Mathematics 2023-01-04 Yuya Kanado , Kota Saito

For a point set of $n$ elements in the $d$-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers $n$, $d$ and under the assumption of a…

Computational Geometry · Computer Science 2017-10-03 Daniel Rudolf

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

Metric Geometry · Mathematics 2013-10-25 Matthias Henze

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.

Combinatorics · Mathematics 2007-07-23 Tamon Stephen , Hugh Thomas

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

In any connected non-compact semi-simple Lie group without factors locally isomorphic to SL_2(R), there can be only finitely many lattices (up to isomorphism) of a given covolume. We show that there exist arbitrarily large families of…

Group Theory · Mathematics 2012-12-27 Vincent Emery

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung