English
Related papers

Related papers: On Hardy's Apology Numbers

200 papers

Expansion of real numbers is a basic research topic in number theory. Usually we expand real numbers in one given base. In this paper, we begin to systematically study expansions in multiple given bases in a reasonable way, which is a…

Dynamical Systems · Mathematics 2020-07-22 Yao-Qiang Li

A separated $d$-interval is defined as a disjoint union of $d$ convex sets from the real line $\mathbb R$. In this paper, we establish a series of Helly-type theorems for convexity spaces derived from separated $d$-intervals. Our results…

Combinatorics · Mathematics 2025-05-23 Wei Rao

We give improvements and generalizations of both the classical Hardy inequality and the geometric Hardy inequality based on the divergence theorem. Especially, our improved Hardy type inequality derives both two Hardy type inequalities with…

Analysis of PDEs · Mathematics 2021-04-06 Megumi Sano

We establish a novel improvement of the classical discrete Hardy inequality, which gives the discrete version of a recent (continuous) inequality of Frank, Laptev, and Weidl. Our arguments build on certain weighted inequalities based on…

Functional Analysis · Mathematics 2024-07-09 Prasun Roychowdhury , Durvudkhan Suragan

It is shown that (two-variable generalizations of) more than half of Slater's list of 130 Rogers-Ramanujan identities (L. J. Slater, Further identities of the Rogers-Ramanujan type, \emph{Proc. London Math Soc. (2)} \textbf{54} (1952),…

Number Theory · Mathematics 2018-12-14 Andrew V. Sills

In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to…

Functional Analysis · Mathematics 2014-06-24 Nacib Albuquerque , Frédéric Bayart , Daniel Pellegrino , Juan B. Seoane-Sepúlveda

A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…

Numerical Analysis · Mathematics 2017-06-02 L. D. Petković , M. S. Petković

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

Number Theory · Mathematics 2023-09-15 Joel Louwsma , Joseph Martino

Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on…

Combinatorics · Mathematics 2014-07-01 Tingyao Xiong , Jonathan I. Hall , Hung-ping Tsao

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…

Combinatorics · Mathematics 2025-10-13 Marie-Charlotte Brandenburg , Chiara Meroni

The main purpose of this paper is to investigate characterizations of composition operators on Bloch and Hardy type spaces. Initially, we use general doubling weights to study the composition operators from harmonic Bloch type spaces on the…

Complex Variables · Mathematics 2023-12-11 Shaolin Chen , Hidetaka Hamada

We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…

Logic in Computer Science · Computer Science 2020-04-22 Federico Aschieri , Agata Ciabattoni , Francesco A. Genco

A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…

Computer Science and Game Theory · Computer Science 2023-10-31 Prem Kant , Urban Larsson , Ravi K. Rai , Akshay V. Upasany

We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…

Number Theory · Mathematics 2011-08-01 Neil Lyall , Alex Rice

In 1978, Apery has given sequences of rational approximations to $\zeta(2)$ and $\zeta(3)$ yielding the irrationality of each of these numbers. One of the key ingredient of Apery's proof are second-order difference equations with polynomial…

Number Theory · Mathematics 2007-05-23 Wadim Zudilin

We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…

Number Theory · Mathematics 2012-05-04 Lazhar Fekih-Ahmed

In this paper we prove three differenttypes of the so-called many-particle Hardy inequalities. One of them is a "classical type" which is valid in any dimesnion $d\neq 2$. The second type deals with two-dimensional magnetic Dirichlet forms…

Analysis of PDEs · Mathematics 2014-02-26 M. Hoffmann-Ostenhof , T. Hoffmann-Ostenhof , A. Laptev , J. Tidblom

In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of…

Combinatorics · Mathematics 2020-07-28 Beáta Bényi , Toshiki Matsusaka

We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…

Group Theory · Mathematics 2013-09-06 E. A. O'Brien , C. Voll

The problem of finding the number of lattice points in a triangle has a classical solution if the lattice is $\mathbf{Z}^2$ and the vertices of the triangle have integer valued coordinates. We consider what happens when we replace the…

Number Theory · Mathematics 2022-06-08 Alessandro Lägeler