English
Related papers

Related papers: Transitive $(q-1)$-fold packings of $\rm{PG}_n(q)$

200 papers

A partial $t$-spread in $\mathbb{F}_q^n$ is a collection of $t$-dimensional subspaces with trivial intersection such that each non-zero vector is covered at most once. We present some improved upper bounds on the maximum sizes.

Combinatorics · Mathematics 2017-04-05 Sascha Kurz

A degree $d$ genus $g$ cover of the complex projective line by a smooth irreducible curve $C$ yields a vector bundle on the projective line by pushforward of the structure sheaf. We classify the bundles that arise this way when $d = 5$.…

Algebraic Geometry · Mathematics 2025-10-10 Sam Frengley , Sameera Vemulapalli

We show a simple geometric procedure for an extension of a loop realized as the image $\Sigma ^{\ast}$ of a sharply transitive section in a subgroup $G^{\ast}$ of the projective linear group $PGL(n-1, \mathbb K)$ to a loop realized as the…

Group Theory · Mathematics 2015-06-30 Agota Figula , Karl Strabach

Let $k$ be a field. We describe necessary and sufficient conditions for a $k$-linear abelian category to be a noncommutative projective line, i.e. a noncommutative $\mathbb{P}^{1}$-bundle over a pair of division rings over $k$. As an…

Algebraic Geometry · Mathematics 2017-11-22 A. Nyman

An $m$-$cover$ of lines of a finite projective space ${\rm PG}(r,q)$ (of a finite polar space $\cal P$) is a set of lines $\cal L$ of ${\rm PG}(r,q)$ (of $\cal P$) such that every point of ${\rm PG}(r,q)$ (of $\cal P$) contains $m$ lines of…

Combinatorics · Mathematics 2018-07-03 A. Cossidente , F. Pavese

A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study…

Combinatorics · Mathematics 2007-06-19 Geoffrey Pearce

In this paper we completely classify spreads of 2-dimensional subspaces of a 6-dimensional vector space over a finite field of characteristic not two or three upon which a cyclic group acts transitively. This addresses one of the remaining…

Combinatorics · Mathematics 2023-09-14 Cian Jameson , John Sheekey

The conventional probabilistic point of view implies that if a particle has a probability $p$ to make a transition from one site to another site, then the average transport should be $<Q>=p}$ with a variance $Var(Q)=(1-p)p$. In the quantum…

Mesoscale and Nanoscale Physics · Physics 2008-02-22 Maya Chuchem , Doron Cohen

We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that…

Combinatorics · Mathematics 2020-01-22 Gabe Cunningham

Using spaces of homomorphisms and the descending central series of the free groups, simplicial spaces are constructed for each integer q>1 and every topological group G, with realizations B(q,G) that filter the classifying space BG. In…

Algebraic Topology · Mathematics 2011-09-14 Alejandro Adem , Frederick R. Cohen , Enrique Torres-Giese

A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications…

Combinatorics · Mathematics 2019-12-24 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

Folding transformation of the Painlev\'e equations is an algebraic (of degree greater than 1) transformation between solutions of different equations. In 2005 Tsuda, Okamoto and Sakai classified folding transformations of differential…

Exactly Solvable and Integrable Systems · Physics 2021-10-29 M. Bershtein , A. Shchechkin

The projective general linear group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ acts as a $3$-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over…

Information Theory · Computer Science 2020-10-20 Cunsheng Ding , Chunming Tang , Vladimir D. Tonchev

Given a finite vector space $V=\mathbb{F}_q^n$, the $q$-analogue of a graph, called a $q$-graph, is a pair $\Gamma=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of $1$-dimensional subspaces of $V$ and $\mathcal{E}$ is a subset…

Combinatorics · Mathematics 2026-01-30 Daniel R Hawtin , Padraig Ó Catháin

Let C be a general connected, smooth, projective curve of positive genus g. For each nonnegative integer i we give formulas for the number of pairs (P,Q) em C x C off the diagonal such that (g+i-1)Q-(i+1)P is linearly equivalent to an…

Algebraic Geometry · Mathematics 2007-05-23 Caterina Cumino , Eduardo Esteves , Letterio Gatto

A conjecture of Bondal-Polishchuk states that, in particular for the bounded derived category of coherent sheaves on a smooth projective variety, the action of the braid group on full exceptional collections is transitive up to shifts. We…

Algebraic Geometry · Mathematics 2024-08-01 Johannes Krah

A finite linear space is a finite set of points and lines, where any two points lie on a unique line. Well known examples include projective planes. This project focuses on linear spaces which admit certain types of symmetries. Symmetries…

Combinatorics · Mathematics 2007-05-23 Gregory Cresp

There is a type of distance-regular graph, said to be $Q$-polynomial. In this paper we investigate a generalized $Q$-polynomial property involving a graph that is not necessarily distance-regular. We give a detailed description of an…

Combinatorics · Mathematics 2023-06-09 Paul Terwilliger

New examples of Cameron-Liebler line classes in $\mathrm{PG}(3,q)$ are given with parameter $\frac{1}{2}(q^2 -1)$. These examples have been constructed for many odd values of $q$ using a computer search, by forming a union of line orbits…

Combinatorics · Mathematics 2020-07-01 Morgan Rodgers

A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment…

Combinatorics · Mathematics 2023-06-27 Minjia Shi , XiaoXiao Li , Patrick Solé