English
Related papers

Related papers: A generalization of Selfridge's question

200 papers

Some basic properties of the ring of integers $\mathbb{Z}$ are extended to entire rings. In particular, arithmetic in entire principal rings is very similar than arithmetic in the ring of integers $\mathbb{Z}$. These arithmetic properties…

History and Overview · Mathematics 2013-02-14 Alexandre Laugier

In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…

Number Theory · Mathematics 2025-02-06 K. Venkatasubbareddy , A. Sankaranarayanan

The present paper establishes boundedness of $[m-\frac n2+\frac 12]$ derivatives for the solutions to the polyharmonic equation of order $2m$ in arbitrary bounded open sets of $\RR^n$, $2\leq n\leq 2m+1$, without any restrictions on the…

Analysis of PDEs · Mathematics 2012-06-04 Svitlana Mayboroda , Vladimir Maz'ya

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

Representation Theory · Mathematics 2023-11-09 Steven Benzel , Scott Conner , Nham Ngo , Khang Pham

We define the finite number ring ${\Bbb Z}_n [\sqrt [m] r]$ where $m,n$ are positive integers and $r$ in an integer akin to the definition of the Gaussian integer ${\Bbb Z}[i]$. This idea is also introduced briefly in [7]. By definition,…

Rings and Algebras · Mathematics 2023-12-05 Suk-Geun Hwang , Woo Jeon , Ki-Bong Nam , Tung T. Nguyen

We are concerned with the general problem of proving the existence of joint distributions of two discrete random variables $M$ and $N$ subject to infinitely many constraints of the form $\mathbb{P}\left(M=i,N=j\right)=0$. In particular, the…

Probability · Mathematics 2020-03-18 Joseph Squillace

This paper is concerned with the problem of finding two sets of integers, $\{a_1, a_2, \ldots$, $a_m\}$ and $\{b_1, b_2, \ldots, b_n\}$, such that all the $mn$ sums $a_i+b_j, i=1, \ldots, m, j=1, \ldots, n$, are perfect squares. A method is…

Number Theory · Mathematics 2025-08-12 Ajai Choudhry

Let $K$ be the field of Laurent series with complex coefficients, let $\mathcal{R}$ be the inverse limit of the standard-graded polynomial rings $K[x_1, \ldots, x_n]$, and let $\mathcal{R}^{\flat}$ be the subring of $\mathcal{R}$ consisting…

Commutative Algebra · Mathematics 2020-02-25 Andrew Snowden

Let $\mathbf{A}_{n, m}$ be the polynomial ring $\text{Sym}(\mathbf{C}^n \otimes \mathbf{C}^m)$ with the natural action of $\mathbf{GL}_m(\mathbf{C})$. We construct a family of $\mathbf{GL}_m(\mathbf{C})$-stable ideals $J_{n, m}$ in…

Commutative Algebra · Mathematics 2024-07-19 Karthik Ganapathy

In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…

We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…

Number Theory · Mathematics 2026-02-17 Hichem Gargoubi , Sayed Kossentini

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

Combinatorics · Mathematics 2019-07-16 Jose G. Mijares

For given integers a,b, and j at least 1 we determine the set of integers n for which a^n-b^n is divisible by n^j. For j=1,2, this set is usually infinite; we find explicitly the exceptional cases for which a,b the set is finite. For j=2,…

Number Theory · Mathematics 2009-09-15 Chris Smyth

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

Combinatorics · Mathematics 2007-05-23 William M. Y. Goh , Pawel Hitczenko , Ali Shokoufandeh

A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…

Combinatorics · Mathematics 2020-02-25 Richard Montgomery , Alexey Pokrovskiy , Benny Sudakov

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

Combinatorics · Mathematics 2016-10-07 Suprokash Hazra

Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…

Combinatorics · Mathematics 2007-05-23 Glenn G. Chappell

The algebra of ${\rm GL}_n$-invariants of $m$-tuples of $n\times n$ matrices with respect to the action by simultaneous conjugation is a classical topic in case of infinite base field. On the other hand, in case of a finite field generators…

Rings and Algebras · Mathematics 2025-01-15 Artem Lopatin

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

Combinatorics · Mathematics 2019-03-14 Tiefeng Jiang , Ke Wang

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

Combinatorics · Mathematics 2012-08-23 William Y. C. Chen , Ae Ja Yee , Albert J. W. Zhu
‹ Prev 1 3 4 5 6 7 10 Next ›