English
Related papers

Related papers: Cameron-Liebler Line Classes with parameter $x=\fr…

200 papers

We study equations with infinitely many derivatives. Equations of this type form a new class of equations in mathematical physics. These equations originally appeared in p-adic and later in fermionic string theories and their investigation…

Mathematical Physics · Physics 2008-11-26 Yaroslav Volovich

Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…

Information Theory · Computer Science 2016-04-18 Ziling Heng , Qin Yue

We constuct a family of hemisystems of the parabolic quadric $\mathcal{Q}(2d, q)$, for all ranks $d \ge 2$ and all odd prime powers $q$, that admit $\Omega_3(q) \cong \mathrm{PSL}_2(q)$. This yields the first known construction for $d \ge…

Combinatorics · Mathematics 2019-08-26 Jesse Lansdown , Alice C. Niemeyer

The existence of $q$-ary linear complementary pairs (LCPs) of codes with $q> 2$ has been completely characterized so far. This paper gives a characterization for the existence of binary LCPs of codes. As a result, we solve an open problem…

Information Theory · Computer Science 2023-12-18 Shitao Li , Minjia Shi , San Ling

Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…

Classical Analysis and ODEs · Mathematics 2007-12-27 F. M. Mahomed , A. Qadir

A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is $q$-multilinear if for each its output gate $o$ and for each prime implicant $s$ of the…

Computational Complexity · Computer Science 2023-05-15 Andrzej Lingas , Mia Persson

We construct all integral non-group-theoretical modular categories of dimension $p^2q^2$, where $p$ and $q$ are distinct prime numbers, establishing that a necessary and sufficient condition for their existence is that $p \mid q+1$, and…

Quantum Algebra · Mathematics 2024-04-08 César Galindo , Julia Plavnik , Eric C. Rowell

In this paper, two new families of MDS quantum convolutional codes are constructed. The first one can be regarded as a generalization of \cite[Theorem 6.5]{GGGlinear}, in the sense that we do not assume that $q\equiv1\pmod{4}$. More…

Information Theory · Computer Science 2015-06-22 Guanghui Zhang , Bocong Chen , Liangchen Li

A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…

Rings and Algebras · Mathematics 2023-02-09 Manuel Kauers , Philipp Nuspl , Veronika Pillwein

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…

Information Theory · Computer Science 2021-01-22 Xiaoqiang Wang , Dabin Zheng , Cunsheng Ding

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

Number Theory · Mathematics 2019-03-19 Tai Do Duc , Ka Hin Leung , Bernhard Schmidt

Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…

Information Theory · Computer Science 2021-10-11 Can Xiang , Chunming Tang , Qi Liu

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

Number Theory · Mathematics 2018-07-24 Andrew N. W. Hone , L. Edson Jeffery , Robert G. Selcoe

By using a generalization of Sturm-Liouville problems in $q$-difference spaces, a class of symmetric $q$-orthogonal polynomials with four free parameters is introduced. The standard properties of these polynomials, such as a second order…

Classical Analysis and ODEs · Mathematics 2013-11-01 I. Area , M. Masjed-Jamei

In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such Cayley graph…

Combinatorics · Mathematics 2024-11-15 Sergey Goryainov , Denis Krotov

A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…

Information Theory · Computer Science 2019-03-20 Weiqiong Wang , Yan Wang

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

Group Theory · Mathematics 2008-09-10 Norbert Peyerimhoff , Alina Vdovina

Let $p$ and $q$ be two distinct odd primes, $p<q$ and $E_{p,q}:y^2=x^3-pqx$ be an elliptic curve. Fix a line $L_{a.b}:y=\frac{a}{b}x$ where $a\in \mathbb{Z},b\in \mathbb{N}$ and $(a,b)=1$. We study sufficient conditions that $p$ and $q$…

Number Theory · Mathematics 2025-12-02 Eldar Sultanow , Anja Jeschke , Amir Darwish Tfiha , Madjid Tehrani , William J Buchanan

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…

Combinatorics · Mathematics 2010-01-19 Frank H. Lutz

We give an algorithm to explicitly determine all elements of the $q$-torsion (for $q$ an odd prime) of the Brauer group of an elliptic curve over any base field of characteristic different from $q$, containing a primitive $q$-th root of…

Algebraic Geometry · Mathematics 2022-11-23 Charlotte Ure