English
Related papers

Related papers: Partial spreads and vector space partitions

200 papers

In this short note, we study the distribution of spreads in a point set $\mathcal{P} \subseteq \mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $\varepsilon > 0$, if $|\mathcal{P}|…

Combinatorics · Mathematics 2018-01-03 Ben Lund , Thang Pham , Le Anh Vinh

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…

Combinatorics · Mathematics 2018-12-17 Thomas Honold , Michael Kiermaier , Sascha Kurz

Based on the weighted and shifted Gr\"{u}nwald difference (WSGD) operators [24], we further construct the compact finite difference discretizations for the fractional operators. Then the discretization schemes are used to approximate the…

Numerical Analysis · Mathematics 2014-01-30 Han Zhou , WenYi Tian , Weihua Deng

Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…

Metric Geometry · Mathematics 2007-07-16 Oliver Henkel

A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…

Information Theory · Computer Science 2024-07-30 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…

Analysis of PDEs · Mathematics 2024-04-04 Pascal Auscher , Moritz Egert

A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace…

Information Theory · Computer Science 2025-12-23 Sascha Kurz

Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods.…

Statistical Mechanics · Physics 2012-04-10 Haijun Zhou , Chuang Wang , Jing-Qing Xiao , Zedong Bi

Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…

Computational Geometry · Computer Science 2021-10-22 Karl Bringmann

We study algorithmic problems on subsets of Euclidean space of low fractal dimension. These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory. There are several…

Data Structures and Algorithms · Computer Science 2017-03-29 Anastasios Sidiropoulos , Vijay Sridhar

We study maps from a 2D world-sheet to a 2D target space which include folds. The geometry of folds is discussed and a metric on the space of folded maps is written down. We show that the latter is not invariant under area preserving…

High Energy Physics - Theory · Physics 2019-08-15 O. Ganor , J. Sonnenschein , S. Yankielowicz

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

Information Theory · Computer Science 2012-06-08 Elisa Gorla , Felice Manganiello , Joachim Rosenthal

In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…

Optimization and Control · Mathematics 2026-02-12 Cordian Riener , Jan Rolfes , Frank Vallentin

We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders…

Computational Complexity · Computer Science 2022-03-30 Dmytro Gavinsky , Pavel Pudlák

The concepts of spread and spread dimension of a metric space were introduced by Willerton in the context of quantifying biodiversity of ecosystems. This paper develops practical applications of spread dimension in the context of machine…

Metric Geometry · Mathematics 2023-08-04 Kevin Dunne

For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…

Combinatorics · Mathematics 2024-03-14 Debsoumya Chakraborti , Ben Lund

In this paper we focus on the finite-dimensional approximation of quasi-static evolutions of critical points of the phase-field model of brittle fracture. In a space discretized setting, we first discuss an alternating minimization scheme…

Numerical Analysis · Mathematics 2019-03-07 Stefano Almi , Sandro Belz

We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…

High Energy Physics - Theory · Physics 2013-01-22 Gianluca Calcagni

In general, it is difficult to measure distances in the Weil-Petersson metric on Teichm\"uller space. Here we consider the distance between strata in the Weil-Petersson completion of Teichm\"uller space of a surface of finite type. Wolpert…

Geometric Topology · Mathematics 2020-12-03 Martin Bridgeman , Kenneth Bromberg

The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…

Combinatorics · Mathematics 2007-05-29 Dan Bernstein