English
Related papers

Related papers: Maximal arcs and extended cyclic codes

200 papers

Denniston \cite{D1969} constructed partial difference sets (PDS) with parameters $(2^{3m}, (2^{m+r}-2^m+2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m\geq…

Combinatorics · Mathematics 2024-07-23 Jingjun Bao , Qing Xiang , Meng Zhao

The question of existence of a maximal subgroup in the multiplicative group D* of a division algebra D finite dimensional over its center F is investigated. We prove that if D* has no maximal subgroup, then deg(D) is not a power of 2,…

Rings and Algebras · Mathematics 2008-12-19 R. Hazrat , A. R. Wadsworth

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Group Theory · Mathematics 2025-08-11 Peice Hua

Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 4$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$ dominates a vertex $z$ if $x\rightarrow z$ and $y\rightarrow z$; in this case, we call the pair…

Combinatorics · Mathematics 2016-07-15 Samvel Kh. Darbinyan

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

Milliet asks the following question: given two prime numbers $p\neq q$, is there a division algebra of characteristic $p$ which is of dp-rank $q^2$ and of dimension $q^2$ over its center? We answer in the affirmative. We also give an…

Rings and Algebras · Mathematics 2021-06-21 Christian d'Elbée

In this article we study the endomorphism algebras of abelian varieties $A$ defined over a given number field $K$ with large cyclic 2-torsion fields. A key step in doing so is to provide criteria for all the endomorphisms of $A$ to be…

Number Theory · Mathematics 2026-03-24 Pip Goodman

Let $\mathscr{S}_n(q)$ denote the set of symmetric bilinear forms over an $n$-dimensional $\mathbb{F}_q$-vector space. A subset $\mathcal{C}$ of $\mathscr{S}_n(q)$ is called a $d$-code if the rank of $A-B$ is larger than or equal to $d$ for…

Combinatorics · Mathematics 2025-12-23 Wei Tang , Yue Zhou

A {\bf strong arc decomposition} of a digraph $D=(V,A)$ is a partition of its arc set $A$ into two sets $A_1,A_2$ such that the digraph $D_i=(V,A_i)$ is strong for $i=1,2$. Bang-Jensen and Yeo (2004) conjectured that there is some $K$ such…

Combinatorics · Mathematics 2023-09-14 Joergen Bang-Jensen , Yun Wang

We study the problem of embedding bipartite graphs in Ahlfors-David regular sets of large dimension using results from extremal graph theory. Our main theorem states that any graph satisfying a power-improving bound on the extremal number…

Classical Analysis and ODEs · Mathematics 2026-04-03 Alex McDonald

Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…

Number Theory · Mathematics 2019-12-02 Georges Gras

We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree d = (1/2+a)n. For any constant a > 0, we give an optimal answer in the following sense: let…

Combinatorics · Mathematics 2012-11-15 Daniela Kühn , John Lapinskas , Deryk Osthus

A cut in a digraph $D=(V,A)$ is a set of arcs $\{uv \in A: u\in U, v\notin U\}$, for some $U\subseteq V$. It is known that the arc set $A$ is covered by $k$ cuts if and only if it admits a $k$-coloring such that no two consecutive arcs $uv,…

Combinatorics · Mathematics 2024-10-10 Maximilian Krone

We prove two "large images" results for the Galois representations attached to a degree $d$ Q-curve $E$ over a quadratic field $K$: if $K$ is arbitrary, we prove maximality of the image for every prime $p >13$ not dividing $d$, provided…

Number Theory · Mathematics 2007-05-23 Francesc Bars , Luis Dieulefait

Let $G=(V,E)$ be a directed graph. A $2$-edge-twinless block in $G$ is a maximal vertex set $C^{t}\subseteq V$ with $|C^{t}|>1$ such that for any distinct vertices $v,w \in C^{t}$, and for every edge $e\in E$, the vertices $v,w$ are in the…

Data Structures and Algorithms · Computer Science 2022-05-10 Raed Jaberi

In this paper, we compute explicitly the $q$-dimensions of highest weight crystals modulo $q^n-1$ for a quantum group of arbitrary finite type under certain assumption, and interpret the modulo computations in terms of the cyclic sieving…

Combinatorics · Mathematics 2021-05-28 Young-Tak Oh , Euiyong Park

We prove that there exist infinitely many elliptic curves over $\mathbb{Q}(i)$ with $j$-invariant $1728$ and rank exactly $2$ which are not obtained by base change from $\mathbb{Q}$. The rank of each such curve is determined via 2-isogeny…

Number Theory · Mathematics 2025-08-22 Ben Savoie

In this paper, we show that the maximum number of points in $d\geq3$ dimensions determining exactly 2 distinct triangles is $2d$. We further show that this maximum is uniquely achieved by the vertices of the $d$-orthoplex. We build upon the…

Combinatorics · Mathematics 2024-03-27 Hazel N. Brenner , James S. Depret-Guillaume , Eyvindur A. Palsson , Steven Senger

A subset $\mathcal{S}$ of a conic $\mathcal{C}$ in the projective plane $\mathrm{PG}(2,q)$ is called almost complete (AC-subset for short) if it can be extended to a larger arc in $\mathrm{PG}(2,q)$ only by the points of…

Combinatorics · Mathematics 2017-12-29 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 10$ other than a directed cycle. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$ dominates a vertex $z$ if $x\rightarrow z$ and $y\rightarrow z$; in this…

Combinatorics · Mathematics 2017-06-02 Samvel Kh. Darbinyan , Iskandar A. Karapetyan