English
Related papers

Related papers: A Complex Primitive $N$th Root Of Unity: A Very El…

200 papers

We explore primitive Pythagorean triples of special forms $(a,b,b+g)$ and $(a,a+f,c)$, with $g,f\in\mathbb{Z}^+$. For each $g$ and $f$, we provide a method to generate infinitely many such primitive triples. Lastly, for each $g$, we…

Number Theory · Mathematics 2021-02-10 Andrew Schmelzer , Sunil Chetty

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

General Mathematics · Mathematics 2017-06-20 N. A. Carella

We set up a homological algebra for N-complexes, which are graded modules together with a degree -1 endomorphism d satisfying d^N=0. We define Tor- and Ext-groups for N-complexes and we compute them in terms of their classical counterparts…

q-alg · Mathematics 2013-10-15 Christian Kassel , Marc Wambst

Let $q=p^k$ be a prime power, let $\mathbb{F}_q$ be a finite field and let $n\geq2$ be an integer. This note investigates the existence small primitive normal elements in finite field extensions $\mathbb{F}_{q^n}$. It is shown that a small…

General Mathematics · Mathematics 2026-01-06 N. A. Carella

Using the properties of the ideal of the coordinate Hermite interpolation on n-dimensional grid [4], we prove that the extension k in k[x1, x2, ..., xn] / (f1(x1), ..., fn(xn)) has a primitive element if and only if at most one of the…

Algebraic Geometry · Mathematics 2024-05-01 Aristides I. Kechriniotis

We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…

Numerical Analysis · Computer Science 2014-10-09 Bahman Kalantari , Eric Lee

Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…

Numerical Analysis · Mathematics 2019-07-09 Remi Imbach , Victor Y. Pan , Chee Yap , Ilias S. Kotsireas , Vitaly Zaderman

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

Circular and non-wellfounded proofs have become an increasingly popular tool for metalogical treatments of systems with forms of induction and/or recursion. In this work we investigate the expressivity of a variant CT of G\"odel's system T…

Logic in Computer Science · Computer Science 2021-01-19 Anupam Das

We obtain a simple relations for the Newman sum over multiples of a prime with a primitive or semiprimitive root 2. We consider the case of p=17 as well.

Number Theory · Mathematics 2007-10-09 Vladimir Shevelev

The computation of the cohomology for finite groups of Lie type in the describing characteristic is a challenging and difficult problem. In earlier work, the authors constructed an induction functor which takes modules over the finite group…

Group Theory · Mathematics 2011-12-13 Christopher P. Bendel , Daniel K. Nakano , Cornelius Pillen

We present a replacement for traditional Riemann integrals in undergraduate calculus, which supplements naive precalculus and at the same time opens a way to more sophisticated theories such as Lebesgue integration.

History and Overview · Mathematics 2024-07-23 Shigeru Yamagami

This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.

Group Theory · Mathematics 2021-08-03 Cai Heng Li , Lei Wang , Binzhou Xia

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

Quantum Algebra · Mathematics 2014-10-20 Simon Lentner , Daniel Nett

Representations of Quantum Groups U_q (g_n), g_n any semi simple Lie algebra of rank n, are constructed from arbitrary representations of rank n-1 quantum groups for q a root of unity. Representations which have the maximal dimension and…

High Energy Physics - Theory · Physics 2009-10-22 Wolfgang A. Schnizer

We introduce a categorical analogue of Saito's notion of primitive forms. Let $W$ denote the potential $\frac{1}{n+1} x^{n+1}$. For the category $MF(W)$ of matrix factorizations of $W$ we prove that there exists a unique, up to non-zero…

Algebraic Geometry · Mathematics 2021-04-22 Andrei Caldararu , Si Li , Junwu Tu

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…

Logic · Mathematics 2013-11-28 George Barmpalias

Some idea, which leads to a non-trivial solution of the quantum four-simplex equation, is exposed in this paper. We call this idea "pentagonal algebra". Few examples of the realisation of this idea are given here, and thus few examples of…

Mathematical Physics · Physics 2024-07-29 Sergey Sergeev

Let $W$ be a finite irreducible real reflection group, which is a Coxeter group. We explicitly construct a basis for the module of differential 1-forms with logarithmic poles along the Coxeter arrangement by using a primitive derivation. As…

Combinatorics · Mathematics 2010-02-19 Takuro Abe , Hiroaki Terao

We give a brief survey of primitivity in ring theory and in particular look at characterizations of primitive ideals in the prime spectrum for various classes of rings.

Rings and Algebras · Mathematics 2020-08-18 Jason P. Bell