English
Related papers

Related papers: Evasive subspaces

200 papers

We establish an analytic Hasse principle for linear spaces of affine dimension m on a complete intersection over an algebraic field extension K of Q. The number of variables required to do this is no larger than what is known for the…

Number Theory · Mathematics 2016-10-28 Julia Brandes

In this paper we introduce a new technique to prove the existence of closed subspaces of maximal dimension inside sets of topological vector sequence spaces. The results we prove cover some sequence spaces not studied before in the context…

Functional Analysis · Mathematics 2015-10-06 Geraldo Botelho , Daniel Cariello , Vinícius Fávaro , Daniel Pellegrino

An overpartition is a partition such that the first occurrence (equivalently, the last occurrence) of a number may be overlined. In this article, we investigate three contents of overpartitions. We first consider the $r$-chain minimal and…

Combinatorics · Mathematics 2026-01-29 Y. H. Chen , Y. Q. Chen , Thomas Y. He , H. X. Huang , X. Zhang

In this article, we investigate collections of `well-spread-out' projective (and linear) subspaces. Projective $k$-subspaces in $\mathsf{PG}(d,\mathbb{F})$ are in `higgledy-piggledy arrangement' if they meet each projective subspace of…

Combinatorics · Mathematics 2014-09-23 Szabolcs L. Fancsali , Péter Sziklai

Utilizing sets of super-vector fields (derivations), explicit expressions are obtained for; (a.) the 1D, N-extended superconformal algebra, (b.) the 1D, N-extended super Virasoro algebra for N = 1, 2 and 4 and (c.) a geometrical realization…

High Energy Physics - Theory · Physics 2012-08-27 S. James Gates, , Lubna Rana

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

Information Theory · Computer Science 2026-05-29 Haojie Chen , Chuangqiang Hu , Junjie Huang , Chang-An Zhao

A $(v,k;r)$ Heffter space is a resolvable $(v_r,b_k)$ configuration whose points form a half-set of an abelian group $G$ and whose blocks are all zero-sum in $G$. It was recently proved that there are infinitely many orders $v$ for which,…

Combinatorics · Mathematics 2024-08-23 Marco Buratti , Anita Pasotti

We prove that if a subset of $(\mathbb{F}_q^n)^k$ (with $q$ an odd prime power) avoids a full-rank three-point pattern $\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d}$ then it is exponentially small, having size at most $3 \cdot c_q^{nk}$…

Combinatorics · Mathematics 2022-08-31 Mohamed Omar

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. We determine the maximal dimension for an affine subspace of $n$ by $n$ symmetric (or alternating) matrices with entries in $\mathbb{K}$ and with…

Rings and Algebras · Mathematics 2016-04-21 Clément de Seguins Pazzis

Let $V$ be a finite dimensional vector space over a finite field. Suppose that $\mathscr{F}_1$, $\mathscr{F}_2$, $\dots$, $\mathscr{F}_r$ are $r$-cross $t$-intersecting families of $k$-subspaces of $V$. In this paper, we determine the…

Combinatorics · Mathematics 2024-05-01 Tian Yao , Dehai Liu , Kaishun Wang

Let $f(X) \in \mathbb{F}_{q^r}[X]$ be a $q$-polynomial. If the $\mathbb{F}_q$-subspace $U=\{(x^{q^t},f(x)) \mid x \in \mathbb{F}_{q^n}\}$ defines a maximum scattered linear set, then we call $f(X)$ a scattered polynomial of index $t$. The…

Combinatorics · Mathematics 2019-05-29 Daniele Bartoli , Maria Montanucci

We study the question of explicitly constructing variety-evasive subspace families, a pseudorandom primitive introduced by Guo (Computational Complexity 2024) that generalizes both hitting sets and lossless rank condensers. Roughly…

Computational Complexity · Computer Science 2026-05-08 Robert Andrews , Abhibhav Garg

In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…

Combinatorics · Mathematics 2017-02-28 Angsuman Das

The hypercube Q_n is the graph whose vertex set is {0,1}^n and where two vertices are adjacent if they differ in exactly one coordinate. For any subgraph H of the cube, let ex(Q_n, H) be the maximum number of edges in a subgraph of Q_n…

Combinatorics · Mathematics 2010-05-05 David Conlon

An ultrametric space or infinity-metric space is defined by a dissimilarity function that satisfies a strong triangle inequality in which every side of a triangle is not larger than the larger of the other two. We show that search in…

Information Retrieval · Computer Science 2026-02-10 Antonio Pariente , Ignacio Hounie , Santiago Segarra , Alejandro Ribeiro

We introduce the problem of constructing explicit variety evasive subspace families. Given a family $\mathcal{F}$ of subvarieties of a projective or affine space, a collection $\mathcal{H}$ of projective or affine $k$-subspaces is…

Computational Complexity · Computer Science 2024-10-15 Zeyu Guo

Let $(\tilde Q,g) $ be a para-quaternionic Hermitian structure on the real vector space $V$. By referring to the tensorial presentation $(V, \tilde{Q},g) \simeq (H^2 \otimes E^{2n}, \mathfrak{sl}(H),\omega^H \otimes \omega^E)$, we give an…

Differential Geometry · Mathematics 2015-05-20 Massimo Vaccaro

Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…

Combinatorics · Mathematics 2019-10-15 Esen Aksoy Yazici

Equations for submanifolds, which correspond to embeddings of the four-dimensional FRW universes in five-dimensional pseudo-Euclidean spaces, are presented in convenient form in general case. Several specific examples are considered.

General Relativity and Quantum Cosmology · Physics 2012-03-13 Igor E. Gulamov , Mikhail N. Smolyakov

One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…

Information Theory · Computer Science 2021-03-19 Xianmang He , Yindong Chen , Zusheng Zhang , Kunxiao Zhou
‹ Prev 1 4 5 6 7 8 10 Next ›