English
Related papers

Related papers: Residue Classes Having Tardy Totients

200 papers

We prove a result about reducibility behaviour of Thue polynomials over the rationals that was conjectured by M\"uller. More precisely, we show that, apart from few explicitly given exceptions, these polynomials have only finitely many…

Number Theory · Mathematics 2016-10-05 Joachim König

Erd\H{o}s first conjectured that infinitely often we have $\varphi(n) = \sigma(m)$, where $\varphi$ is the Euler totient function and $\sigma$ is the sum of divisor function. This was proven true by Ford, Luca and Pomerance in 2010. We ask…

Number Theory · Mathematics 2018-09-07 Patrick Meisner

This is a mathematical commentary on Teichm{\"u}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{\"a}chen'' (Determination of extremal quasiconformal maps of closed oriented…

Geometric Topology · Mathematics 2015-10-12 Annette A'Campo-Neuen , Norbert A'Campo , Vincent Alberge , Athanase Papadopoulos

An iterative optimization method applied to a function $f$ on $\mathbb{R}^n$ will produce a sequence of arguments $\{\mathbf{x}_k\}_{k \in \mathbb{N}}$; this sequence is often constrained such that $\{f(\mathbf{x}_k)\}_{k \in \mathbb{N}}$…

Numerical Analysis · Mathematics 2018-01-08 Nathaniel J. McClatchey

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

Formal Languages and Automata Theory · Computer Science 2016-07-07 Prateek Karandikar , Manfred Kufleitner , Philippe Schnoebelen

The purpose of this article is two-folds. Firstly, we establish two sufficient conditions under which the sequence $\{f(n)\pmod{m}: n\geq1\}$ is non-periodic, where $f(n)$ is an arithmetic function. As consequences, we deduce that the…

General Mathematics · Mathematics 2026-02-17 Tapas Chatterjee , Sagar Mandal

We show that for many families of transcendental entire functions $f$ the property that $m^n(r)\to\infty$ as $n\to \infty$, for some $r>0$, where $m(r)=\min\{|f(z)|:|z|=r\}$, implies that the escaping set $I(f)$ of $f$ has the structure of…

Dynamical Systems · Mathematics 2018-10-19 Daniel A. Nicks , Philip J. Rippon , Gwyneth M. Stallard

A class of increasing sequences of natural numbers $(n_k)$ is found for which there exists a function $f\in L[0,1)$ such that the subsequence of partial Walsh-Fourier sums $(S_{n_k}(f))$ diverge everywhere. A condition for the growth order…

Analysis of PDEs · Mathematics 2019-12-11 Ushangi Goginava , Giorgi Oniani

The minimal excludant of an integer partition is the least positive integer missing from the partition. Let $\sigma_o\text{mex}(n)$ (resp., $\sigma_e\text{mex}(n)$) denote the sum of odd (resp., even) minimal excludants over all the…

Number Theory · Mathematics 2023-11-01 Gurinder Singh , Rupam Barman

Let $R$ be a ring with identity, $\mathcal{U}(R)$ the group of units of $R$ and $k$ a positive integer. We say that $a\in \mathcal{U}(R)$ is $k$-unit if $a^k=1$. Particularly, if the ring $R$ is $\mathbb{Z}_n$, for a positive integer $n$,…

Number Theory · Mathematics 2022-12-21 John H. Castillo , Jhony Fernando Caranguay Mainguez

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

Combinatorics · Mathematics 2024-07-01 Thomas Y. He , C. S. Huang , H. X. Li , X. Zhang

In this paper we describe an inductive machinery to investigate asymptotic behaviors of homology groups and related invariants of representations of certain graded combinatorial categories over a commutative Noetherian ring $k$, via…

Representation Theory · Mathematics 2019-03-21 Wee Liang Gan , Liping Li

The partition function $ p_{[1^c\ell^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{\ell}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{\ell n})^d}.\] In \cite{P}, we proved infinite family of…

Number Theory · Mathematics 2020-11-17 Shashika Petta Mestrige

We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…

Number Theory · Mathematics 2022-04-07 Michael Hanson , Jeremiah Smith

In this short note, we introduce an Euler analogue of Wilson's theorem; $a_1a_2... a_{\phi(n)}\equiv (-1)^{\phi(n)+1}~({\rm mod}~n)$ say, where ${\rm gcd}(a_i,n)=1$.

Number Theory · Mathematics 2007-05-23 Mehdi Hassani , Mahmoud Momeni-Pour

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

Number Theory · Mathematics 2026-04-10 Russelle Guadalupe

We prove asymptotic formulae for small weighted solutions of quadratic congruences of the form $\lambda_1x_1^2+\cdots +\lambda_nx_n^2\equiv \lambda_{n+1}\bmod{p^m}$, where $p$ is a fixed odd prime, $\lambda_1,...,\lambda_{n+1}$ are integer…

Number Theory · Mathematics 2026-01-29 Stephan Baier , Arkaprava Bhandari , Anup Haldar

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Number Theory · Mathematics 2016-12-23 Junxian Li , Kyle Pratt , George Shakan

In [Ramanujan J. 52 (2020), 275-290], Romik considered the Taylor expansion of Jacobi's theta function $\theta_3(q)$ at $q=e^{-\pi}$ and encoded it in an integer sequence $(d(n))_{n\ge0}$ for which he provided a recursive procedure to…

Number Theory · Mathematics 2024-10-15 Christian Krattenthaler , Thomas W. Müller