中文
相关论文

相关论文: The covering radius of $\mathrm{PGL}_2(q)$

200 篇论文

We give a complete classification of self-dual completely regular codes with covering radius $\rho \leq 3$. For $\rho=1$ the results are almost trivial. For $\rho=2$, by using properties of the more general class of uniformly packed codes…

信息论 · 计算机科学 2024-09-17 J. Borges , V. A. Zinoviev

Based on the most recent QSO ultraviolet spectra, the covering factor of the clouds of the Broad Line Region (BLR) is about 30%, or larger. This value would imply that in at least 30% of the QSOs our line of sight crosses one, or more, BLR…

天体物理学 · 物理学 2009-11-06 R. Maiolino , M. Salvati , A. Marconi , R. R. J. Antonucci

Let $q(H)$ be the signless Laplacian spectral radius of a graph $H$. In this paper, we prove that \\1. Let $H$ be a proper subgraph of a $\Delta$-regular graph $G$ with $n$ vertices and diameter $D$. Then $$2\Delta -…

组合数学 · 数学 2016-10-28 Qi Kong , Ligong Wang

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…

组合数学 · 数学 2023-06-09 Paul Terwilliger

In this paper, we show that a set of q+a hyperplanes, q>13, a<(q-10)/4, that does not cover PG(n,q), does not cover at least q^(n-1)-aq^(n-2) points, and show that this lower bound is sharp. If the number of non- covered points is at most…

组合数学 · 数学 2012-10-04 Stefan Dodunekov , Leo Storme , Geertrui Van de Voorde

A covering of a digraph $D$ by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of $D$. We prove that for $1/2 \geq p\geq \frac{\log^{20} n}{n}$, the random…

组合数学 · 数学 2024-10-18 Asaf Ferber , Marcelo Sales , Mason Shurman

For each finite subgroup $G$ of $PGL_2(\mathbb{Q})$, and for each integer $n$ coprime to $6$, we construct explicitly infinitely many Galois extensions of $\mathbb{Q}$ with group $G$ and whose ideal class group has $n$-rank at least…

数论 · 数学 2021-11-05 Jean Gillibert , Pierre Gillibert

The sum-rank metric can be seen as a generalization of both, the rank and the Hamming metric. It is well known that sum-rank metric codes outperform rank metric codes in terms of the required field size to construct maximum distance…

信息论 · 计算机科学 2022-10-06 Cornelia Ott , Hedongliang Liu , Antonia Wachter-Zeh

In this paper we introduce and study a family $\mathcal{A}_n(q)$ of abelian subgroups of $\GL_n(q)$ covering every element of $\GL_n(q)$. We show that $\mathcal{A}_n(q)$ contains all the centralisers of cyclic matrices and equality holds if…

群论 · 数学 2010-04-21 A. Azad , M. A. Iranmanesh , C. E. Praeger , P. Spiga

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

组合数学 · 数学 2016-09-07 Michael S. Lang , Paul M. Terwilliger

A \emph{finite cover} of a group $G$ is a finite collection $\mathcal{C}$ of proper subgroups of $G$ with the property that $\bigcup \mathcal{C} = G$. A finite group admits a finite cover if and only if it is noncyclic. More generally, it…

群论 · 数学 2021-09-21 Michael Epstein

A $q$-ary $t$-covering array is an $m \times n$ matrix with entries from $\{0, 1, ..., q-1\}$ with the property that for any $t$ column positions, all $q^t$ possible vectors of length $t$ occur at least once. One wishes to minimize $m$ for…

组合数学 · 数学 2011-11-03 Soohak Choi , Hyun Kwang Kim , Dong Yeol Oh

The \emph{intersection density} of a transitive permutation group $G\leq \operatorname{Sym}(\Omega)$ is the ratio between the largest size of a subset of $G$ in which any two agree on at least one element of $\Omega$, and the order of a…

组合数学 · 数学 2025-03-25 Karen Meagher , Andriaherimanana Sarobidy Razafimahatratra

A {\em generalized hyperfocused arc} $\mathcal H $ in $PG(2,q)$ is an arc of size $k$ with the property that the $k(k-1)/2$ secants can be blocked by a set of $k-1$ points not belonging to the arc. We show that if $q$ is a prime and…

组合数学 · 数学 2013-04-15 A. Blokhuis , G. Marino , F. Mazzocca

We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…

信息论 · 计算机科学 2026-05-06 Peter Boyvalenkov , Ferruh Ozbudak , Maya Stoyanova

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

度量几何 · 数学 2019-05-01 Galyna V. Livshyts

The total diameter of a closed planar curve $C\subset R^2$ is the integral of its antipodal chord lengths. We show that this quantity is bounded below by twice the area of $C$. Furthermore, when $C$ is convex or centrally symmetric, the…

微分几何 · 数学 2015-01-20 Mohammad Ghomi , Ralph Howard

For a partially multiplicative quandle (PMQ) $\mathcal{Q}$ we consider the topological monoid $\mathring{\mathrm{HM}}(\mathcal{Q})$ of Hurwitz spaces of configurations in the plane with local monodromies in $\mathcal{Q}$. We compute the…

代数拓扑 · 数学 2024-11-20 Andrea Bianchi

Given a (2N - 1)-dimensional projective space over GF(2), PG(2N - 1, 2), and its geometric spread of lines, there exists a remarkable mapping of this space onto PG(N - 1, 4) where the lines of the spread correspond to the points and…

数学物理 · 物理学 2012-09-19 Metod Saniga

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…

组合数学 · 数学 2020-07-01 Morgan Rodgers