English
Related papers

Related papers: On Blocking Sets of Affine Spaces

200 papers

Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…

Combinatorics · Mathematics 2025-04-08 Stijn Cambie , Jaehoon Kim , Hyunwoo Lee , Hong Liu , Tuan Tran

Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…

Rings and Algebras · Mathematics 2026-05-07 Clément de Seguins Pazzis

We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many…

Group Theory · Mathematics 2007-05-23 Balazs Szegedy

In this paper, we study a second order variational problem for locally convex hypersurfaces, which is the affine invariant analogue of the classical Plateau problem for minimal surfaces. We prove existence, regularity and uniqueness results…

Differential Geometry · Mathematics 2007-05-23 Neil S. Trudinger , Xu-Jia Wang

Two subspaces of a vector space are here called ``nonintersecting'' if they meet only in the zero vector. The following problem arises in the design of noncoherent multiple-antenna communications systems. How many pairwise nonintersecting…

Combinatorics · Mathematics 2014-09-17 Frederique E. Oggier , N. J. A. Sloane , A. R. Calderbank , Suhas N. Diggavi

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Zeev Dvir , Shubhangi Saraf , Charles Wolf

We give an upper bound for the number of points of a hypersurface over a finite field that has no lines on, in terms of the dimension, the degree, and the number of the elements of the finite field.

Algebraic Geometry · Mathematics 2014-10-14 Masaaki Homma

It is shown that the diffeomorphism type of the complement to a real space line arrangement in any dimensional affine ambient space is determined only by the number of lines and the data on multiple points.

Geometric Topology · Mathematics 2020-10-07 Goo Ishikawa , Motoki Oyama

Working over the field of order 2 we consider those complete caps (maximal sets of points with no three collinear) which are disjoint from some codimension 2 subspace of projective space. We derive restrictive conditions which such a cap…

Combinatorics · Mathematics 2007-05-23 David L. Wehlau

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

Number Theory · Mathematics 2024-11-18 Imre Bárány , Gergely Harcos , János Pach , Gábor Tardos

In this paper we give some basic results on blocking sets on minimum size for a finite chain geometry.

Combinatorics · Mathematics 2013-04-05 Andrea Blunck , Hans Havlicek , Corrado Zanella

We solve the convergence case of the generalized Baker-Schmidt problem for simultaneous approximation on affine subspaces, under natural diophantine type conditions. In one of our theorems, we do not require monotonicity on the…

Number Theory · Mathematics 2020-01-08 Jing-Jing Huang , Jason J. Liu

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

Commutative Algebra · Mathematics 2007-05-23 Eduardo Cattani , Alicia Dickenstein

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

Functional Analysis · Mathematics 2012-01-18 Ivan Feshchenko , Alexander Strelets

We endow the set of complements of a fixed subspace of a projective space with the structure of an affine space, and show that certain lines of such an affine space are affine reguli or cones over affine reguli. Moreover, we apply our…

Algebraic Geometry · Mathematics 2024-02-13 Andrea Blunck , Hans Havlicek

We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…

Combinatorics · Mathematics 2013-05-31 Sudhir R. Ghorpade , Samrith Ram

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo

In this note, we investigate the maximal number of intersection points of a line with the contour of hypersurface amoebas in $\mathbb{R}^n$. We define the latter number to be the $\mathbb{R}$-degree of the contour. We also investigate the…

Algebraic Geometry · Mathematics 2019-05-21 Lionel Lang , Boris Shapiro , Eugenii Shustin

We show that through a point of an affine variety there always exists a smooth plane curve inside the ambient affine space, which has the multiplicity of intersection with the variety at least 3. This result has an application to the study…

alg-geom · Mathematics 2016-08-30 Anvar R. Mavlyutov

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Computational Geometry · Computer Science 2017-08-22 Sergey Bereg , Matias Korman , Rodrigo I. Silveira , Ferran Hurtado , Dolores Lara , Jorge Urrutia , Mikio Kano , Carlos Seara , Kevin Verbeek