English
Related papers

Related papers: Classification of Reflective Numbers

200 papers

We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…

Mathematical Physics · Physics 2008-12-10 Mark W. Coffey

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

General Mathematics · Mathematics 2014-12-30 Ramin Zahedi

In this paper, we study the reciprocal sums of the Jacobsthal numbers. We establish many results on the infinite sum and alternating infinite sum of the reciprocals of Jacobsthal numbers and square Jacobsthal numbers.

Number Theory · Mathematics 2022-07-27 Ahmed Gaber

Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…

We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…

Logic in Computer Science · Computer Science 2022-07-01 Marlou M. Gijzen , Hajime Ishihara , Tatsuji Kawai

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

Combinatorics · Mathematics 2017-03-02 Andrei K. Svinin

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

Other Computer Science · Computer Science 2007-05-23 Pierre B. A. Lecomte , Michel Rigo

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

History and Overview · Mathematics 2007-05-23 Wai Yan Pong

We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…

Combinatorics · Mathematics 2017-10-10 Tanay Wakhare

In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…

Logic in Computer Science · Computer Science 2016-07-18 Boas Kluiving , Wijnand van Woerkom

We consider limits over categories of extensions and show how certain well-known functors on the category of groups turn out as such limits. We also discuss higher (or derived) limits over categories of extensions.

Category Theory · Mathematics 2009-05-21 Roman Mikhailov , Inder Bir S. Passi

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

Number Theory · Mathematics 2016-08-16 David Applegate , Benoit Cloitre , Philippe Deléham , N. J. A. Sloane

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

A recursive random number generator using prime reciprocals is described.

Cryptography and Security · Computer Science 2009-07-31 Subhash Kak

After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations.

High Energy Physics - Lattice · Physics 2009-10-22 M. Creutz , I. Horvath , R. Mendris

We classify the module categories over the double (possibly twisted) of a finite group.

Quantum Algebra · Mathematics 2007-05-23 Victor Ostrik

Given any light position S in the complex projective plane P^2 and any algebraic curve C of P^2 (with any kind of singularities), we consider the incident lines coming from S (i.e. the lines containing S) and their reflected lines after…

Algebraic Geometry · Mathematics 2013-04-16 Alfrederic Josse , Francoise Pene

The classification of projective elliptic line scrolls with the description of their singular loci is given. In particular we recover Atiyah Theorem by using classical methods.

Algebraic Geometry · Mathematics 2007-05-23 Luis Fuentes

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski

We obtain a classification of metaplectic modular categories: every metaplectic modular category is a gauging of the particle-hole symmetry of a cyclic modular category. Our classification suggests a conjecture that every weakly-integral…

Quantum Algebra · Mathematics 2017-03-13 Eddy Ardonne , Meng Cheng , Eric C. Rowell , Zhenghan Wang
‹ Prev 1 3 4 5 6 7 10 Next ›