中文
相关论文

相关论文: Average liar count for degree-2 Frobenius pseudopr…

200 篇论文

Given two numerical semigroups $S$ and $T$ and a positive integer $d$, $S$ is said to be one over $d$ of $T$ if $S=\{s \in \mathbb{N} \ | \ ds \in T \}$ and in this case $T$ is called a $d$-fold of $S$. We prove that the minimal genus of…

群论 · 数学 2015-12-03 Francesco Strazzanti

We prove a von Neumann type ergodic theorem for averages of unitary operators arising from the Furstenberg-Poisson boundary representation (the quasi-regular representation) of any lattice in a non-compact connected semisimple Lie group…

动力系统 · 数学 2016-09-20 Adrien Boyer , Gabriele Link , Christophe Pittet

We derive two probabilistic bounds for the relative forward error in the floating point summation of $n$ real numbers, by representing the roundoffs as independent, zero-mean, bounded random variables. The first probabilistic bound is based…

数值分析 · 数学 2021-05-31 Johnathan Rhyne

We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.

概率论 · 数学 2016-04-22 Christos Pelekis , Jan Ramon

We investigate the averages of Dedekind sums over rational numbers in the set $$\mathscr{F}_\alpha(Q):=\{\, {v}/{w}\in \mathbb{Q}: 0<w\leq Q\,\}\cap [0, \alpha)$$ for fixed $\alpha\leq 1/2$. In previous work, we obtained asymptotics for…

数论 · 数学 2025-02-03 Paolo Minelli , Athanasios Sourmelidis , Marc Technau

We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic subwords in a…

离散数学 · 计算机科学 2021-08-06 Kalpana Mahalingam , Palak Pandoh

We apply the Pade technique to find rational approximations to % \[h^{\pm}(q_1,q_2)=\sum_{k=1}^\infty\frac{\q_1^k}{1\pm \q_2^k}, 0<q_1,q_2<1, q_1\in\mathbb{Q}, q_2=1/p_2, p_2\in\mathbb{N}\setminus\{1\}.\] % A separate section is dedicated…

经典分析与常微分方程 · 数学 2007-05-23 Jonathan Coussement , Christophe Smet

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

动力系统 · 数学 2015-11-19 Nikos Frantzikinakis , Bernard Host

A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to…

数论 · 数学 2018-12-18 Jonathan Sondow , Kieren MacMillan

We prove a probabilistic Fourier extension theorem that says Fourier extension holds when averaged over certain smooth Alpert multipliers. The proofs use smooth Alpert wavelets with the classical techniques of stationary phase and…

经典分析与常微分方程 · 数学 2026-04-16 Eric T. Sawyer

We show that a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank has Prufer 2-rank at most two. This article covers the signalizer functor theory and identifies the groups of Lie…

逻辑 · 数学 2008-11-28 Jeffrey Burdges

Consider a testing problem for the null hypothesis $H_0:\theta\in\Theta_0$. The standard frequentist practice is to reject the null hypothesis when the p-value is smaller than a threshold value $\alpha$, usually 0.05. We ask the question…

统计理论 · 数学 2007-06-13 Anirban DasGupta , Tonglin Zhang

In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…

数论 · 数学 2009-06-02 Adway Mitra , Goutam Paul , Ushnish Sarkar

We propose a pseudo-primality test using cyclic extensions of $\mathbb Z/n \mathbb Z$. For every positive integer $k \leq \log n$, this test achieves the security of $k$ Miller-Rabin tests at the cost of $k^{1/2+o(1)}$ Miller-Rabin tests.

数论 · 数学 2019-02-20 Jean-Marc Couveignes , Tony Ezome , Reynald Lercier

We derive a lower bound for the subword complexity of the base-$b$ expansion ($b\geq 2$) of all real numbers whose irrationality exponent is equal to 2. This provides a generalization of a theorem due to Ferenczi and Mauduit. As a…

数论 · 数学 2012-05-07 Boris Adamczewski

An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.

数值分析 · 数学 2025-10-20 Nenad Ujevic

Taking $r>0$, let $\pi_{2r}(x)$ denote the number of prime pairs $(p, p+2r)$ with $p\le x$. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that $\pi_{2r}(x)\sim 2C_{2r} {\rm li}_2(x)$ with an explicit constant $C_{2r}>0$.…

数论 · 数学 2015-05-13 Jaap Korevaar , Herman te Riele

Consider the optimization problem $p_{\min, Q} := \min_{\mathbf{x} \in Q} p(\mathbf{x})$, where $p$ is a degree $m$ multivariate polynomial and $Q := [0, 1]^n$ is the hypercube. We provide explicit degree and error bounds for the sums of…

最优化与控制 · 数学 2014-04-25 Victor Magron

This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…

数论 · 数学 2016-12-07 Michael Mueger

In this work we present a natural generalization of strong pseudoprime to base $b$, which we have called $q$-pseudoprime to base $b$. It allows us to present another way to define a Midy's number to base $b$ (overpseudoprime to base $b$).…