English
Related papers

Related papers: Existence of primitive k-normal elements for criti…

200 papers

A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…

Number Theory · Mathematics 2007-09-17 Melvyn B. Nathanson

A set of positive integers is said to be primitive if no element of the set is a multiple of another. If $S$ is a primitive set and $S(x)$ is the number of elements of $S$ not exceeding $x$, then a result of Erd\H os implies that…

Number Theory · Mathematics 2010-10-28 Greg Martin , Carl Pomerance

Let $K$ be a number field of degree $d$. Then every ideal $I$ in the ring of integers ${\mathcal O}_K$ contains infinitely many primitive elements, i.e. elements of degree $d$. A bound on smallest height of such an element in $I$ follows…

Number Theory · Mathematics 2025-02-12 Lenny Fukshansky , Sehun Jeong

Explicit generating sets are found for all primitive ideals in the generic quantized coordinate rings of the 3x3 special and general linear groups over an arbitrary algebraically closed field. (Previously, generators were only known up to…

Quantum Algebra · Mathematics 2010-08-27 K R Goodearl , T H Lenagan

Let $p$ be a prime number and let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers. Let $N$ be a fully ramified, elementary abelian extension of $K$. Under a mild hypothesis on the extension $N/K$, we show that…

Number Theory · Mathematics 2007-05-23 Nigel P. Byott , G. Griffith Elder

In this paper, we estimate the number of $\mathbb{F}_q$-primitive points on the affine hypersurface defined by the equation $f(x_1,\ldots,x_s)=0$, where $f\in\mathbb{F}_q[x_1,\dots,x_s]$ is an appropriate polynomial. In particular, we…

Number Theory · Mathematics 2025-05-14 José Alves Oliveira , Marcelo Oliveira Veloso

In 2022, S.D. Cohen and the two authors introduced and studied the concept of $(r, n)$-freeness on finite cyclic groups $G$ for suitable integers $r, n$, which is an arithmetic way of capturing elements of special forms that lie in the…

Number Theory · Mathematics 2025-03-11 Giorgos Kapetanakis , Lucas Reis

In this paper, prime as well as primitive Kumjian-Pask algebras $\mathrm{KP}_R(\Lambda)$ of a row-finite $k$-graph $\Lambda$ over a unital commutative ring $R$ are completely characterized in graph-theoretic and algebraic terms. By applying…

Rings and Algebras · Mathematics 2017-01-04 Maryam Kashoul-Radjabzadeh , Hossein Larki , Abdolmohammad Aminpour

This paper examines order three elements of finite groups which normalize no nontrivial 2-subgroup. The motivation for finding such elements arises out of a problem in modular representation theory. The question of when these elements…

Group Theory · Mathematics 2016-10-25 Spencer Gerhardt

We study pairs $(\Gamma,G)$, where $\Gamma$ is a 'Buekenhout-Tits' pregeometry with all rank 2 truncations connected, and $G\leqslant\mathrm{Aut} \Gamma$ is transitive on the set of elements of each type. The family of such pairs is closed…

Combinatorics · Mathematics 2010-09-02 Michael Giudici , Cai Heng Li , Geoffrey Pearce , Cheryl E. Praeger

Let G be a semi-simple algebraic group over a finitely generated field K of characteristic zero, and let \Gamma < G(K) be a finitely generated Zariski-dense subgroup. In this note we prove that the set of K-generic elements of \Gamma (whose…

Group Theory · Mathematics 2017-07-26 Gopal Prasad , Andrei S. Rapinchuk

We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…

Number Theory · Mathematics 2007-05-23 Donald Mills

In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…

General Mathematics · Mathematics 2021-06-29 Duggirala Meher Krishna , Duggirala Ravi

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.

Number Theory · Mathematics 2014-03-19 Stephen D. Cohen , Tomás Oliveira e Silva , Tim Trudgian

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

Number Theory · Mathematics 2007-08-17 Anthony Flatters

Let $q=p^r$ be a prime power, and let $f(x)=x^m-\gs_{m-1}x^{m-1}- >...-\gs_1x-\gs_0$ be an irreducible polynomial over the finite field $\GF(q)$ of size $q$. A zero $\xi$ of $f$ is called {\em nonstandard (of degree $m$) over $\GF(q)$} if…

Information Theory · Computer Science 2008-07-04 Henk D. L. Hollmann

We introduce the notion of the \textit{principal element} of a Frobenius Lie algebra $\f$. The principal element corresponds to a choice of $F\in \f^*$ such that $F[-,-]$ non-degenerate. In many natural instances, the principal element is…

Representation Theory · Mathematics 2015-05-13 Murray Gerstenhaber , Anthony Giaquinto

This is the second in a series of papers investigating the space of Brauer relations of a finite group, the kernel of the natural map from its Burnside ring to the rational representation ring. The first paper classified all primitive…

Representation Theory · Mathematics 2015-08-27 Alex Bartel , Tim Dokchitser

In this work we show that every minimal code in a semisimple group algebra $\mathbb{F}_qG$ is essential if $G$ is a simple group. Since the alternating group $A_n$ is simple if $n=3$ or $n\geq 5$, we present some examples of minimal codes…

Rings and Algebras · Mathematics 2023-10-27 Robson Ricardo de Araujo , Francisco Cesar Polcino Milies , Raul Antonio Ferraz

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

Computational Geometry · Computer Science 2024-05-21 Dror Chawin , Ishay Haviv