English
Related papers

Related papers: The Explicit Formula and Parity for Some Generaliz…

200 papers

"V - E + F = 2", the famous Euler's polyhedral formula, has a natural generalization to convex polytopes in every finite dimension, also known as the Euler-Poincar\'e Formula. We provide another short inductive proof of the general formula.…

Metric Geometry · Mathematics 2021-09-10 Petr Hliněný

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We prove that for any positive integer $k$, there is a number $m$ for which the equation $\sigma(x)=m$ has exactly $k$ solutions, settling a conjecture of Sierpi\'nski from…

Number Theory · Mathematics 2019-10-21 Kevin Ford , Sergei Konyagin

We prove that an odd number is an Euler pseudoprime for exactly one half of the admissible bases if and only if it is a special Carmichael number.

Number Theory · Mathematics 2011-09-19 Lorenzo Di Biagio

Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…

Number Theory · Mathematics 2010-05-26 Youness Lamzouri

We add an analytic trans-exponential function $\varphi$ to $\mathbb{R}_{an,\exp}$. We reduce the o-minimality of $\mathbb{R}_{an,\exp,\varphi}$ to the existence of "many" regular values for some definable systems of functions, which is a…

Logic · Mathematics 2026-04-07 Yayi Fu

Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…

Complex Variables · Mathematics 2017-01-31 Jean-Christophe Feauveau

Motivated by studies in accelerator physics this paper computes the asymptotic behavior of the series $\displaystyle \sum_{k=1}^N \varphi(k) I_N\left(\frac{1}{k}\right)$, where $\varphi(k)$ is Euler's Totient function and $\displaystyle…

Number Theory · Mathematics 2014-07-30 R. Tomas

Let d and m be two natural numbers of distinct parities. Let $\pi$ be an admissible irreducible tempered representation of GL(d,F), where F is a p-adic field. We assume that $\pi$ is self-dual. Then we can extend $\pi$ as a representation…

Representation Theory · Mathematics 2012-05-08 Jean-Loup Waldspurger

We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over F q n for large n, and we investigate the polynomials f of degree 12.

Number Theory · Mathematics 2016-02-03 François Rodier

We study the exact extremal orders of compositions $f(g(n))$ of certain arithmetical functions, including the functions $\sigma(n)$, $\phi(n)$, $\sigma^*(n)$ and $\phi^*(n)$, representing the sum of divisors of $n$, Euler's function and…

Number Theory · Mathematics 2008-09-01 József Sándor , László Tóth

Lehmer's totient problem asks whether there exists any composite number $n$ such that $\varphi(n) \, \mid \, (n-1)$, where $\varphi$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n >…

Number Theory · Mathematics 2021-06-23 Manuel Norman

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

Combinatorics · Mathematics 2018-10-19 Yidong Sun , Liting Zhai

Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…

Group Theory · Mathematics 2017-05-22 A. R. Ashrafi , E. Haghi

An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…

Combinatorics · Mathematics 2024-12-23 Mikhail Isaev , Brendan D. McKay , Rui-Ray Zhang

We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…

Combinatorics · Mathematics 2015-06-11 Mikhail Isaev

The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize…

Number Theory · Mathematics 2021-08-10 Emily Gullerud , Aba Mbirika

We find asymptotic equalities for exact upper bounds of approximations by Fourier sums in uniform metric on classes of $2\pi$-periodic functions, representable in the form of convolutions of functions $\varphi$, which belong to unit balls…

Classical Analysis and ODEs · Mathematics 2016-03-08 A. S. Serdyuk , T. A. Stepaniuk

Let $L$ be a second order uniformly elliptic differential operator in a domain $D$ of $\mathbb{R}^{d}$, $\psi:\mathbb{R}_+\to \mathbb{R}_+$ be a nondecreasing continuous function and let $\xi,g:D\to\mathbb{R}_+$ be locally bounded Borel…

Analysis of PDEs · Mathematics 2022-03-25 Khalifa El Mabrouk , Basma Nayli

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…

Number Theory · Mathematics 2023-02-06 Alessandro Languasco

We prove that for a positive integer a the integer sequence P(n) satisfying for all n, -infty<n<infty, the recurrence P(n)=a+P(n-phi(a)), phi(a) the Euler function, generates in increasing order all integers P(n) coprime to a.The finite…

Number Theory · Mathematics 2014-02-05 Constantin M. Petridi