Results 51 to 60 of about 31,249 (173)

On Eisenstein series in $M_{2k}(\Gamma_0(N))$ and their applications

, 2018
Let $k,N \in \mathbb{N}$ with $N$ square-free and $k>1$. We prove an orthogonal relation and use this to compute the Fourier coefficients of the Eisenstein part of any $f(z) \in M_{2k}(\Gamma_0(N))$ in terms of sum of divisors function. In particular, if
Aygin, Zafer Selcuk
core   +1 more source

Sums of divisors functions and Bessel function series

Journal of Number Theory, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Fixed points of the sum of divisors function on $F_2[x]$

, 2022
We work an analogue of a classical arithmetic problem over polynomials. More precisely, we study the fixed points $F$ of the sum of divisors function $σ: F_2[x] \mapsto F_2[x]$ (defined \emph{mutatis mutandi} like the usual sum of divisors over the integers) of the form $F := A^2 \cdot S$, $S$ square-free, with $ω(S) \leq 3$, coprime with $A$, for $A ...
openaire   +4 more sources

Euler Polynomials and Combinatoric Convolution Sums of Divisor Functions with Even Indices [PDF]

Abstract and Applied Analysis, 2014
We study combinatoric convolution sums of certain divisor functions involving even indices. We express them as a linear combination of divisor functions and Euler polynomials and obtain identitiesD2k(n)=(1/4)σ2k+1,0(n;2)-2·42kσ2k+1(n/4)  -(1/2)[∑d|n,d≡1  (4){E2k(d)+E2k(d-1)}+22k∑d|n,d≡1  (2)E2k((d+(-1)(d-1)/2)/2)],U2k(p,q)=22k-2[-((p+q)/2)E2k((p+q)/2+1)
Kim, Daeyeoul, Bayad, Abdelmejid, Park, Joongsoo   +2 more
openaire   +4 more sources

Sonified Signals From a Compact FT‐ICR Instrument: A Feasibility Study. I—Data Mapping to an Equal‐Tempered Chromatic Scale

Rapid Communications in Mass Spectrometry, EarlyView.
ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley   +1 more source

Converting an Integer to a Decimal String in Under Two Nanoseconds

Software: Practice and Experience, EarlyView.
ABSTRACT Objective Converting binary integers to variable‐length decimal strings is a fundamental operation in computing. Conventional fast approaches rely on recursive division and small lookup tables. The goal of this work is to develop a significantly faster method for this task.
Jaël Champagne Gareau, Daniel Lemire
wiley   +1 more source

Analogies and differences between the logic behind statistical hypothesis testing and proofs by contradiction: What can we learn from them?

Teaching Statistics, EarlyView.
Abstract Statistical hypothesis testing (SHT) is widely employed across numerous scientific disciplines, and a clear understanding of its underlying logic is essential for the broader scientific community. Here, drawing upon both epistemological and statistical perspectives, we aim to clarify—primarily for educational purposes—the logical relationship ...
Maria Cristina Amoretti, Daniele De Martini   +1 more
wiley   +1 more source

On certain upper bounds for the sum of divisors function σ(n) [PDF]

Acta Universitatis Sapientiae, Mathematica, 2015
Abstract Upper bounds for σ(n) are provided in terms of other arithmetic functions as ϕ(n), d(n), ψ(n), P(n), etc. Comparision of older results are given, too.
Sándor József, Kovács Lehel István
openaire   +2 more sources

Predictors of reduced length of stay in minimally invasive colectomy, a 20‐year study

Surgical Practice, EarlyView.
Abstract Purpose Minimally invasive colorectal resection is a common surgical procedure indicated for a variety of malignant and benign conditions. Length of stay (los) is an important metric in the evaluation of surgical care quality and healthcare expenditure.
Elisa Tran, Angel Hayes, Amy Cao, Andrew Stevenson, David Clark   +4 more
wiley   +1 more source

A fast metaheuristic approach for the planar multiple obnoxious facility location problem

International Transactions in Operational Research, EarlyView.
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar, Abraham Duarte, J. Manuel Colmenar   +2 more
wiley   +1 more source