Results 81 to 90 of about 41,624 (236)
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 +2 more
wiley +1 more source
Moments of zeta and correlations of divisor-sums: IV [PDF]
Research in Number Theory, 2015 We examine the calculation of the second and fourth moments and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. Previously, this approach has proved unsuccessful in computing moments beyond the eighth, even heuristically.
Conrey, Brian, Keating, Jonathan P.
openaire +22 more sources
The Brill-Noether curve and Prym-Tyurin varieties
, 2012 We prove that the Jacobian of a general curve C of genus g=2a+1, with g>4, can be realized as a Prym-Tyurin variety for the Brill-Noether curve W^1_{a+2}(C).
Ortega, Angela
core +1 more source
Testing for Unspecified Periodicities in Binary Time Series
Journal of Time Series Analysis, EarlyView.ABSTRACT Given random variables Y1,…,Yn$$ {Y}_1,\dots, {Y}_n $$ with Yi∈{0,1}$$ {Y}_i\in \left\{0,1\right\} $$ we test the hypothesis whether the underlying success probabilities pi$$ {p}_i $$ are constant or whether they are periodic with an unspecified period length of r≥2$$ r\ge 2 $$.
Finn Schmidtke, Mathias Vetter
wiley +1 more source
Noûs, EarlyView.ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
AROUND EULER'S THEOREM ON SUMS OF DIVISORS [PDF]
Vestnik Tomskogo gosudarstvennogo universiteta. Matematika i mekhanika, 2018 Summary: This work relates to experimental mathematics. Two problems solved by Euler are considered. In the first task, the number of partitions for natural numbers is counted; the solution of the second task gives the recursion regularity connecting the sums of dividers of natural numbers.
openaire +2 more sources
Panel Sequential Group Estimation of Interactive Effects Models
Oxford Bulletin of Economics and Statistics, EarlyView.ABSTRACT This paper proposes a novel procedure to identify latent groups in the slopes of panel data models with interactive effects. The method is straightforward to apply and relies only on closed‐form estimators when evaluating the objective function.
Ignace De Vos, Joakim Westerlund
wiley +1 more source
The Mathematical History Behind the Granger–Johansen Representation Theorem
Oxford Bulletin of Economics and Statistics, EarlyView.ABSTRACT When can a vector time series that is integrated once (i.e., becomes stationary after taking first differences) be described in error correction form? The answer to this is provided by the Granger–Johansen representation theorem. From a mathematical point of view, the theorem can be viewed as essentially a statement concerning the geometry of ...
Johannes M. Schumacher
wiley +1 more source
Sums of Divisors and Egyptian Fractions
Journal of Number Theory, 1993 The author discusses the presentation of rational numbers as a sum of Egyptian fractions, i.e. fractions of the form \(1/X_ i\), \(X_ i\) integers \(>1\), and related problems. A number \(n\) is called abundant, if the sum of all positive divisors of \(n\) is \(\geq 2n\). If \({\mathbf p}=(p_ 1,p_ 1,\dots,p_ k)\) is a vector of different primes and \({\
openaire +1 more source
Divisor sums representable as the sum of two squares [PDF]
Proceedings of the American Mathematical Society, 2020 Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$ which are a sum of two squares.
openaire +2 more sources