English
Related papers

Related papers: Meertens number and its variations

200 papers

Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Waring problem in numbers of class $\mathbb{N}_0$ is solved.

Number Theory · Mathematics 2012-02-07 K. M. Eminyan

It is known that prime numbers occupy specific geometrical patterns or moduli when numbers from one to infinity are distributed around polygons having sides that are integer multiple of number 6. In this paper, we will show that not only…

General Mathematics · Mathematics 2019-03-29 Robert E. Grant , Talal Ghannam

We introduce the notion of almost realizability, an arithmetic generalization of realizability for integer sequences, which is the property of counting periodic points for some map. We characterize the intersection between the set of…

Number Theory · Mathematics 2025-08-18 Piotr Miska , Tom Ward

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

Combinatorics · Mathematics 2008-08-06 Terence Tao , Van Vu

In the middle of the third millennium BC the Sumerians must have noticed that the reciprocal of the number 7,in contrast to the numbers 1,2,3,4,5,and 6,could not be expressed by a finite sexagesimal fraction but it recurred every three…

History and Overview · Mathematics 2014-07-24 Kazuo Muroi

A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…

Combinatorics · Mathematics 2011-04-08 Stéphane Legendre

Univoque numbers are real numbers $\lambda > 1$ such that the number 1 admits a unique expansion in base $\lambda$, i.e., a unique expansion $1 = \sum_{j \geq 0} a_j \lambda^{-(j+1)}$, with $a_j \in \{0, 1, ..., \lceil \lambda \rceil -1\}$…

Number Theory · Mathematics 2015-05-13 Jean-Paul Allouche , Christiane Frougny

Considering the problem of finding all the integer solutions of the sum of $M$ consecutive integer squares starting at $a^{2}$ being equal to a squared integer $s^{2}$, it is shown that this problem has no solutions if $M\equiv3,5,6,7,8$ or…

Number Theory · Mathematics 2014-09-30 Vladimir Pletser

Our purpose is to prove the uniqueness of the representation for $G$-martingales with finite variation.

Probability · Mathematics 2011-01-04 Yongsheng Song

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

General Mathematics · Mathematics 2007-05-23 Boris V. Tarasov

Let $B_{n}(t)$ be the $n$th Stern polynomial, i.e., the $n$th term of the sequence defined recursively as $B_{0}(t)=0, B_{1}(t)=1$ and $B_{2n}(t)=tB_{n}(t), B_{2n+1}(t)=B_{n}(t)+B_{n-1}(t)$ for $n\in\N$. It is well know that $i$th…

Number Theory · Mathematics 2019-09-25 Maciej Ulas

To a complex polynomial function $f$ with arbitrary singularities we associate the number of Morse points in a general linear Morsification $f_{t} := f - t\ell$. We produce computable algebraic formulas in terms of invariants of $f$ for the…

Algebraic Geometry · Mathematics 2024-10-30 Laurenţiu Maxim , Mihai Tibăr

Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…

Combinatorics · Mathematics 2019-10-09 Michela Ceria

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

Combinatorics · Mathematics 2016-10-10 Gábor Hegedüs

Restricted Whitney numbers of the first kind appear in the combinatorial recursion for the matroid Kazhdan-Lusztig polynomials. In the special case of braid matroids (the matroid associated to the partition lattice, the complete graph, the…

Combinatorics · Mathematics 2018-02-06 Trevor K. Karn , Max D. Wakefield

A permutohedral variety is a remarkable object in various areas of mathematics, and its topological invariants are widely recognized. However, only little is known about a real permutohedral variety, that is, the real locus of a…

Algebraic Topology · Mathematics 2024-10-01 Suyoung Choi , Younghan Yoon

This paper provides new lower bounds for van der Waerden numbers using Rabung's method, which colors based on the discrete logarithm modulo some prime. Through a distributed computing project with 500 volunteers over one year, we checked…

Combinatorics · Mathematics 2022-11-22 Daniel Monroe

Complex-mass (finite-width) $0^{++}$ nonet and decuplet are investigated by means of exotic commutator method. The hypothesis of vanishing of the exotic commutators leads to the system of master equations (ME). Solvability conditions of…

High Energy Physics - Phenomenology · Physics 2009-01-07 Michal Majewski

Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…

Number Theory · Mathematics 2025-05-01 Suparno Ghoshal , Arijit Jana

We first give a summary of the history of transcendental numbers then use a nice technique by G. Dresden to prove a new transcendental number. In particular, while previous work looked at the last non-zero digit of $n^n$, we consider the…

Number Theory · Mathematics 2020-01-09 Hung Viet Chu