中文
相关论文

相关论文: Arithmetic of the Fabius function

200 篇论文

The study of complexity measures of Boolean functions led Nisan and Szegedy to state the sensitivity conjecture in 1994, claiming a polynomial relation between degree and sensitivity. This problem remained unsolved until 2019, when Huang…

组合数学 · 数学 2024-09-25 Sara Asensio , Ignacio García-Marco , Kolja Knauer

We show that the denominator formula for the strange series of affine superalgebras, conjectured by Kac and Wakimoto and proved by Zagier, follows from a classical determinant evaluation of Frobenius. As a limit case, we obtain exact…

数论 · 数学 2007-05-23 Hjalmar Rosengren

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

数论 · 数学 2019-10-08 Matthew C. Lettington , Karl Michael Schmidt

For any positive integers $n\geq 3, r\geq 1$ we present formulae for the number of irreducible polynomials of degree $n$ over the finite field $\mathbb{F}_{2^r}$ where the coefficients of $x^{n-1}$, $x^{n-2}$ and $x^{n-3}$ are zero. Our…

In this paper, we consider the general divisor functions over Piatetski-Shapiro sequences. We can give some general results which contain some special divisor functions. Precisely, we extend the divisor problem over Piatetski-Shapiro…

数论 · 数学 2026-04-21 Wei Zhang

We produce formulas for $$\sum_{j=1}^{2^{n-2}}\frac{1}{\sin^s\left(\frac{(2j-1)\pi}{2^n}\right)}$$ in terms of Generalized Bernoulli and Euler polynomials and use one of the formulas to produce a nice integral representation of the Riemann…

综合数学 · 数学 2026-05-13 Leon D. Fairbanks

In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation $n!=x^2-1$. It is conjectured that this equation has only three solutions, but up to now this is an open problem. Overholt observed…

数论 · 数学 2023-09-26 Saša Novaković

The Dirichlet lambda function $\lambda(s)$ is defined for $\mathrm{Re}(s) > 1$ by \[ \lambda(s) = \sum_{n=0}^{\infty} \frac{1}{(2n+1)^s}. \] This function was initially studied by Euler on the real line, where he denoted it by $N(s)$. In…

数论 · 数学 2025-07-15 Su Hu , Min-Soo Kim

Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…

数论 · 数学 2024-09-20 Zhi-Hong Sun , Dongxi Ye

In 1987 Harris proved (Proc. Amer. Math. Soc., 101) - among others- that for each $1\le p<2$ there exists a two-dimensional function $f\in L^p$ such that its triangular Walsh-Fourier series diverges almost everywhere. In this paper we…

经典分析与常微分方程 · 数学 2018-05-18 György Gát

We are looking at families of functions or measures on the torus which are specified by a finite number of parameters $N$. The task, for a given family, is to look at a small number of Fourier coefficients of the object, at a set of…

经典分析与常微分方程 · 数学 2022-08-11 Benedikt Diederichs , Mihail N. Kolountzakis , Effie Papageorgiou

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

数论 · 数学 2026-02-16 Meselem Karras

We consider the Lommel functions $s_{\mu,\nu}(z)$ for different values of the parameters $(\mu,\nu)$. We show that if $(\mu,\nu)$ are half integers, then it is possible to describe these functions with an explicit combination of polynomials…

经典分析与常微分方程 · 数学 2024-06-28 Federico Zullo

Let $F$ be a vectorial Boolean function from $\mathbb{F}_2^n$ to $\mathbb{F}_2^m$, with $m \geq n$. We define $F$ as an embedding if $F$ is injective. In this paper, we examine the component functions of $F$, focusing on constant and…

密码学与安全 · 计算机科学 2025-05-29 Augustine Musukwa , Massimiliano Sala

We study three questions related to Machin's type formulas. The first one gives all two terms Machin formulas where both arctangent functions are evaluated $2$-integers, that is values of the form $b/2^a$ for some integers $a$ and~$b$.…

数论 · 数学 2025-01-03 Armengol Gasull , Florian Luca , Juan L. Varona

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…

数论 · 数学 2024-09-16 Seyran S. Ibrahimov , Nazim I. Mahmudov

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

数论 · 数学 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

We present some simple proofs of the well-known expressions for \[ \zeta(2k) = \sum_{m=1}^\infty \frac{1}{m^{2k}}, \qquad \beta(2k+1) = \sum_{m=0}^\infty \frac{(-1)^m}{(2m+1)^{2k+1}}, \] where $k = 1,2,3,\dots$, in terms of the Bernoulli…

数论 · 数学 2025-01-03 Óscar Ciaurri , Luis M. Navas , Francisco J. Ruiz , Juan L. Varona

We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^\beta| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom…

组合数学 · 数学 2020-12-07 Christian Krattenthaler , Carsten Schneider

In this article, a class of analytic functions is investigated and their some properties are established. Several recurrence relations and various classes of bilinear and bilateral generating functions for these analytic functions are also…

经典分析与常微分方程 · 数学 2016-05-11 Rabia Aktas , Abdullah Altin , Fatma Tasdelen