English
Related papers

Related papers: Notes and Note-Pairs in Noergaard's Infinity Serie…

200 papers

The discovery of the infinite integer leads to a partition between finite and infinite numbers. Construction of an infinitesimal and infinitary number system, the Gossamer numbers. Du Bois-Reymond's much-greater-than relations and…

General Mathematics · Mathematics 2015-04-07 Chelton D. Evans , William K. Pattinson

In this article we present an axiomatic definition of sets with individuals and a definition of natural numbers and ordinals. We use the axioms pairs, union, power, regularity and separation. We define the equality of sets and of…

Logic · Mathematics 2022-06-01 D. H. Homan

This paper is a continuation of the paper Int. Electron. J. Algebra 6 (2009), 219-227. Namely, we introduce and study a doubly filtered set of classes of rings of finite Gorenstein global dimension, which are called $(n,m)$-SG for integers…

Rings and Algebras · Mathematics 2009-07-20 Driss Bennis

Let $\sigma(n)$ be the sum of the divisors of $n$. Kalita and Saikia defined a number $n$ to be near superperfect if $2n+d=\sigma(\sigma(n))$ for some positive divisor $d$ of $n$. We extend some of their results about near superperfect…

Number Theory · Mathematics 2025-05-23 Satvik Beri , Joshua Zelinsky

A sequence $A$ of positive integers having the property that no element $a_i \in A$ divides the sum $a_j+a_k$ of two larger elements is said to have `Property P'. We construct an infinite set $S\subset \mathbb{N}$ having Property P with…

Number Theory · Mathematics 2017-08-04 Christian Elsholtz , Stefan Planitzer

Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…

Quantum Physics · Physics 2019-03-18 Aram W. Harrow , Anand Natarajan , Xiaodi Wu

Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…

Combinatorics · Mathematics 2017-09-13 Mahdi Saleh , Majid Jahangiri

We carefully analyze the N=2 dual pair of string theories in four dimensions introduced by Ferrara, Harvey, Strominger and Vafa. The analysis shows that a second discrete degree of freedom must be switched on in addition to the known…

High Energy Physics - Theory · Physics 2008-11-26 Paul S. Aspinwall

Translation from the Latin original, "Inventio summae cuiusque seriei ex dato termino generali" (1735). E47 in the Enestrom index. In this paper Euler derives the Euler-Maclaurin summation formula, by expressing y(x-1) with the Taylor…

History and Overview · Mathematics 2008-06-26 Leonhard Euler

Let $G$ be a finite cyclic group of order $n \ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot ... \cdot (n_lg)$ where $g\in G$ and $n_1,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

Combinatorics · Mathematics 2011-03-14 Weidong Gao , Yuanlin Li , Jiangtao Peng , Chris Plyley , Guoqing Wang

Prefix normal words are binary words that have no factor with more $1$s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipt\'ak, DLT 2011]. In this paper, we study infinite prefix normal words…

Combinatorics · Mathematics 2021-05-31 Ferdinando Cicalese , Zsuzsanna Lipták , Massimiliano Rossi

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

Number Theory · Mathematics 2022-05-10 Fang-Yu Ma

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Combinatorics · Mathematics 2024-05-30 James A. Sellers

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

Number Theory · Mathematics 2021-05-18 Arne Winterhof , Zibi Xiao

We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as…

Combinatorics · Mathematics 2019-04-11 Jakob Ablinger

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

Number Theory · Mathematics 2022-12-06 José L. Cereceda

A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…

Formal Languages and Automata Theory · Computer Science 2021-06-01 Paweł Gawrychowski , Samah Ghazawi , Gad M. Landau

The author advocates two specific mathematical notations from his popular course and joint textbook, "Concrete Mathematics". The first of these, extending an idea of Iverson, is the notation "[P]" for the function which is 1 when the…

History and Overview · Mathematics 2008-02-03 Donald E. Knuth

Let $[x]$ be the greatest integer not exceeding $x$. In the paper we introduce the sequence $\{U_n\}$ given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]}\binom n{2k}U_{n-2k}\quad(n\ge 1)$, and establish many recursive formulas and congruences…

Number Theory · Mathematics 2010-12-21 Zhi-Hong Sun
‹ Prev 1 8 9 10 Next ›