English
Related papers

Related papers: Denniston partial difference sets exist in the odd…

200 papers

Given a finite poset P, we consider pairs of linear extensions of P with maximal distance, where the distance between two linear extensions L_1, L_2 is the number of pairs of elements of P appearing in different orders in L_1 and L_2. A…

Combinatorics · Mathematics 2008-09-11 Graham Brightwell , Mareike Massow

We establish an injective correspondence $M\longrightarrow\mathcal E(M)$ between real-analytic nonminimal hypersurfaces $M\subset\mathbb{C}^{2}$, spherical at a generic point, and a class of second order complex ODEs with a meromorphic…

Complex Variables · Mathematics 2014-01-29 Ilya Kossovskiy , Rasul Shafikov

In [Problems on polytopes, their groups, and realizations, Periodica Math. Hungarica 53 (2006) 231-255] Schulte and Weiss proposed the following problem: {\em Characterize regular polytopes of orders $2^np$ for $n$ a positive integer and…

Combinatorics · Mathematics 2024-07-16 Dong-Dong Hou , Yan-Quan Feng , Dimitri Leemans

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

Combinatorics · Mathematics 2025-03-20 Alex Elzenaar , Shayne Waldron

Moore digraphs, that is digraphs with out-degree $d$, diameter $k$ and order equal to the Moore bound $M(d,k) = 1 + d + d^2 + \dots +d^k$, arise in the study of optimal network topologies. In an attempt to find digraphs with a `Moore-like'…

Combinatorics · Mathematics 2021-06-29 James Tuite

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu

Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric…

Information Theory · Computer Science 2026-04-03 Martino Borello , Olga Polverino , Ferdinando Zullo

An extremity is a vertex such that the removal of its closed neighbourhood does not increase the number of connected components. Let $Ext_{\alpha}$ be the class of all connected graphs whose quotient graph obtained from modular…

Data Structures and Algorithms · Computer Science 2023-02-28 Guillaume Ducoffe

A new mneumonic device is shown to emerge in connection with O(7) numerical tensors exhibiting duality and reflecting the natural 7=(4+3) splitting of 7-dimensional space. Then Desargues' and Pappus' theorems are shown to be connected…

High Energy Physics - Theory · Physics 2007-05-23 Sultan Catto

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

Combinatorics · Mathematics 2009-10-08 Simon R. Blackburn , Tuvi Etzion , Keith M. Martin , Maura B. Paterson

Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete $H^1$ norm best approximation error…

Numerical Analysis · Mathematics 2018-03-06 Peter Oswald

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

Combinatorics · Mathematics 2020-11-16 Antonio Cossidente , Giuseppe Marino , Francesco Pavese

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

Combinatorics · Mathematics 2007-05-23 Kurt Johansson

Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…

Combinatorics · Mathematics 2025-11-26 Takuya Saito

We construct a new family of distance-biregular graphs related to hyperovals and a new sporadic example of a distance-biregular graph related to Mathon's perp system. The infinite family can be explained using 2-$\bipartB$-homogeneity,…

Combinatorics · Mathematics 2026-05-01 Blas Fernández , Ferdinand Ihringer , Sabrina Lato , Akihiro Munemasa

Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent…

Information Theory · Computer Science 2026-04-08 Meiying Zhang , Shudi Yang , Yanbin Zheng

In this paper,we show some $[2n,2n-2,3]$ and $[2n,2n-3,4]$ MDS codes over dihedral codes $F_qD_{2n}$,in the case $n$ is odd and char$F_q$$\nmid$$\lvert G \rvert$ and $F_q$ contains primitive root of exponent $\lvert G \rvert$ i.e $F_q$ is…

Information Theory · Computer Science 2025-02-25 Yuchao Wang

Conformal Galilei Algebras labeled by $d,\ell$ (where $d$ is the number of space dimensions and $\ell$ denotes a spin-${\ell}$ representation w.r.t. the $\mathfrak{sl}(2)$ subalgebra) admit two types of central extensions, the ordinary one…

Mathematical Physics · Physics 2016-07-19 N. Aizawa , Z. Kuznetsova , F. Toppan

Let q be an odd prime power and let f(r) be the minimum size of the symmetric difference of r lines in the Desarguesian projective plane PG(2,q). We prove some results about the function f(r), in particular showing that there exists a…

Combinatorics · Mathematics 2013-10-30 Paul Balister , Béla Bollobás , Zoltán Füredi , John Thompson

In a 1989 paper \cite{arasu2}, Arasu used an observation about multipliers to show that no $(352,27,2)$ difference set exists in any abelian group. The proof is quite short and required no computer assistance. We show that it may be applied…

Combinatorics · Mathematics 2020-07-16 Daniel M. Gordon