Results 51 to 60 of about 96,717 (274)

The Janjić–Petković Inset Counting Function: Riordan Array Properties and a Thermodynamic Application

open access: yesMathematics
Let q1+⋯+qn+m objects be arranged in n rows with q1,…,qn objects and one last row with m objects. The Janjić–Petković counting function denotes the number of (n+k)-insets, defined as subsets containing n+k objects such that at least one object is chosen ...
Marcus Kollar
doaj   +1 more source

An upper bound on binomial coefficients in the de Moivre – Laplace form

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2022
We provide an upper bound on binomial coefficients that holds over the entire parameter range an whose form repeats the form of the de Moivre – Laplace approximation of the symmetric binomial distribution.
Sergey V. Agievich
doaj   +1 more source

Generalised Binomial coefficients and Jarden's Theorem [PDF]

open access: yes, 2013
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functionsComment: A section (section 3) concerning the application of Jarden's Theorem is ...
Cheng Lien, Lang, Mong Lung Lang
core  

The fundamental theorem of algebra: A most elementary proof

open access: yes, 2011
This paper shows an elementary and direct proof of the Fundamental Theorem of Algebra, via Bolzano-Weierstrass Theorem on Minima and the Binomial Formula, that avoids: any root extraction other than the one used to define the modulus function over the ...
de Oliveira, Oswaldo Rio Branco
core   +2 more sources

Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms

open access: yesDecision Sciences, EarlyView.
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham   +2 more
wiley   +1 more source

Closed‐Form Optimal Investment Under Generalized GARCH Models

open access: yesEuropean Financial Management, EarlyView.
ABSTRACT This paper introduces a new class of stochastic volatility models for asset prices, the generalized Heston Nandi GARCH (GHN‐GARCH), with the primary objective of optimal dynamic asset allocation under expected utility theory for constant relative risk aversion investors. We study some of its theoretical properties, and demonstrate that the GHN‐
Marcos Escobar‐Anel   +2 more
wiley   +1 more source

Approximation of the semi-infinite interval

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1980
The approximation of a function f∈C[a,b] by Bernstein polynomials is well-known. It is based on the binomial distribution. O. Szasz has shown that there are analogous approximations on the interval [0,∞) based on the Poisson distribution.
A. McD. Mercer
doaj   +1 more source

Long‐term population changes for the UK stag beetle Lucanus cervus—Evidence from citizen science surveys and museum collections

open access: yesInsect Conservation and Diversity, EarlyView.
The stag beetle Lucanus cervus is a European Protected Species and declining dead wood specialist, but long‐term population trends in the United Kingdom remain largely unknown. We used 82,883 citizen science records and historic data from museum records to compare geographic distribution trends, and results suggest a broadly stable distribution over ...
David E. Wembridge   +5 more
wiley   +1 more source

Efficient and exact sampling of simple graphs with given arbitrary degree sequence. [PDF]

open access: yesPLoS ONE, 2010
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling.
Charo I Del Genio   +3 more
doaj   +1 more source

The Width of Downsets

open access: yes, 2019
How large an antichain can we find inside a given downset in the lattice of subsets of [n]? Sperner's theorem asserts that the largest antichain in the whole lattice has size the binomial coefficient C(n, n/2); what happens for general downsets?
Duffus, Dwight   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy