English
Related papers

Related papers: On the problem of Molluzzo for the modulus 4

200 papers

We establish an elementary, but rather striking pattern concerning the quartic residues of primes $p$ that are congruent to 5 modulo 8. Let $g$ be a generator of the multiplicative group of $\mathbb Z_p$ and let $M$ be the $4\times 4$…

Number Theory · Mathematics 2017-01-05 Christian Aebi , Grant Cairns

This paper outlines a solution to the Straus Erd\H{o}s Conjecture. Namely for each prime $p$ there exists positive integers $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z} $$

Number Theory · Mathematics 2026-02-13 Kyle Bradford

Let m(n) be the number of ordered factorizations of n in factors larger than 1. We prove that for every eps>0 n^{rho} m(n) < exp[(log n)^{1/rho}/(loglog n)^{1+eps}] holds for all integers n>n_0, while, for a constant c>0, n^{rho} m(n) >…

Number Theory · Mathematics 2007-05-23 Martin Klazar , Florian Luca

Recently, Andrews, Hirschhorn and Sellers have proven congruences modulo 3 for four types of partitions using elementary series manipulations. In this paper, we generalize their congruences using arithmetic properties of certain quadratic…

Number Theory · Mathematics 2021-02-03 Jeremy Lovejoy , Robert Osburn

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three…

Combinatorics · Mathematics 2015-02-25 Igor Pak , Greta Panova

We prove that for every nonnegative integer $m$ there exists an $\varepsilon>0$ such that if $\lambda\in (0,\varepsilon]$ and $x$ is sufficiently large in terms of $m$, then the number of positive integers $n\leq x$ for which the interval…

Number Theory · Mathematics 2018-03-01 Daniele Mastrostefano

We study the existence of non-collision periodic solutions with Newtonian potentials for the following planar restricted 4-body problems: Assume that the given positive masses $m_{1},m_{2},m_{3}$ in a Lagrange configuration move in circular…

Mathematical Physics · Physics 2013-01-07 Xiaoxiao Zhao , Shiqing Zhang

We establish some upper bounds for the number of integer solutions to the Thue inequality $|F(x , y)| \leq m$, where $F$ is a binary form of degree $n \geq 3$ and with non-zero discriminant $D$, and $m$ is an integer. Our upper bounds are…

Number Theory · Mathematics 2015-08-17 Shabnam Akhtari

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Combinatorics · Mathematics 2016-04-01 Francesca Merola , Tommaso Traetta

Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following…

Combinatorics · Mathematics 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley

We consider the classical geometric problem of prescribing the scalar and boundary mean curvatures via conformal deformation of the metric on a $n-$dimensional compact Riemannian manifold. We deal with the case of negative scalar curvature…

Analysis of PDEs · Mathematics 2022-11-16 Sergio Cruz-Blázquez , Angela Pistoia , Giusi Vaira

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m$ is congruent to 1 modulo $n,$ for all $a$ and $n$ relatively prime. The function $\lambda_k(n)$ is defined to be the $k$th…

Number Theory · Mathematics 2011-11-17 Nick Harland

In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…

Combinatorics · Mathematics 2023-09-07 Flavien Mabilat

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…

Number Theory · Mathematics 2022-06-07 M. J. Kronenburg

Let $\{E_n\}$ be the Euler numbers. In the paper we determine $E_{2^mk+b}-E_b$ modulo $2^{m+7}$, where $k$ and $m$ are positive integers and $b\in{0,2,4,...}$.

Number Theory · Mathematics 2012-08-06 Zhi-Hong Sun , Lin-Lin Wang

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

In the pinwheel problem, one is given an $m$-tuple of positive integers $(a_1, \ldots, a_m)$ and asked whether the integers can be partitioned into $m$ color classes $C_1,\ldots,C_m$ such that every interval of length $a_i$ has non-empty…

Data Structures and Algorithms · Computer Science 2026-04-16 Robert Kleinberg , Ahan Mishra

We classify parallelizable noncommutative manifold structures on finite sets of small size in the general formalism of framed quantum manifolds and vielbeins introduced previously. The full moduli space is found for $\le 3$ points, and a…

General Relativity and Quantum Cosmology · Physics 2009-11-10 S. Majid , E. Raineri

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Data Structures and Algorithms · Computer Science 2017-03-07 Grzegorz Głuch , Krzysztof Loryś

It will be demonstrated that there is a thin basis of order four of minimal cardinality #A(x) = O(x^.25). The current literature shows the existence of a thin basis of order four of cardinality #A(x) = O(x^(.25+{\epsilon}), {\epsilon} > 0,…

Number Theory · Mathematics 2011-09-01 N. A. Carella