Results 31 to 40 of about 876,906 (306)
On the Distribution of Generating Functions [PDF]
Bulletin of the London Mathematical Society, 1998 The generating function \(f_P(\alpha)\) associated with the \(k\)th powers is defined by \[ f_P(\alpha)= \sum_{1\leq n\leq P} \exp(i2\pi\alpha n^k). \] For \(\alpha\in (0,1]\), let \(f(\alpha)= P^{-1/2}|f_P(\alpha)|\). It has been conjectured that \[ \int_0^1 f(\alpha)^s d\alpha\sim \Gamma (\tfrac s2+1).
Vaughan, RC, Wooley, TD
openaire +3 more sources
Approximating the Cumulant Generating Function of Triangles in the Erdös–Rényi Random Graph [PDF]
, 2021 We study the pressure of the “edge-triangle model”, which is equivalent to the cumulant generating function of triangles in the Erdös–Rényi random graph.
Giardinà, Cristian +5 more
core +1 more source
Highly excited strings I: Generating function
Nuclear Physics B, 2017 This is the first of a series of detailed papers on string amplitudes with highly excited strings (HES). In the present paper we construct a generating function for string amplitudes with generic HES vertex operators using a fixed-loop momentum formalism.
Dimitri P. Skliros +2 more
doaj +1 more source
Hybrid Numbers with Fibonacci and Lucas Hybrid Number Coefficients
Universal Journal of Mathematics and Applications, 2023 In this paper, we introduce hybrid numbers with Fibonacci and Lucas hybrid number coefficients. We give the Binet formulas, generating functions, and exponential generating functions for these numbers. Then we define an associate matrix for these numbers.
Emrah Polatlı
doaj +1 more source
General overlap functions [PDF]
Fuzzy Sets and Systems, 2019 The work has been supported by the Research Services of the Universidad Publica de Navarra, the research projects TIN2016-77356-P (AEI/FEDER, UE) and TIN2015-66471-P from the Government of Spain and by the Brazilian National Counsel of Technological and Scientific Development CNPq (Proc.
Laura De Miguel +6 more
openaire +4 more sources
On the combinatorics of sparsification
Algorithms for Molecular Biology, 2012 Background We study the sparsification of dynamic programming based on folding algorithms of RNA structures. Sparsification is a method that improves significantly the computation of minimum free energy (mfe) RNA structures.
Huang Fenix WD, Reidys Christian M
doaj +1 more source
Some identities of bivariate Pell and bivariate Pell-Lucas polynomials
Journal of Amasya University the Institute of Sciences and Technology, 2023 In this paper, we obtain some identities for the bivariate Pell polynomials and bivariate Pell-Lucas polynomials. We establish some sums and connection formulas involving them.
Yashwant Panwar
doaj +1 more source
On Generalized Mixture Functions.
TFSS, 2022 In the literature it is very common to see problems in which it is necessary to aggregate a set of data into a single one. An important tool able to deal with these issues is the aggregation functions, which we can highlight as the OWA functions. However, there are other functions that are also capable of performing these tasks, such as the ...
Antonio Diego Silva Farias +4 more
openaire +2 more sources
The probability of generating a finite simple group
, 2013 We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG.
Colva M. Roney-Dougal +5 more
core +1 more source
A Short Note on Integral Transformations and Conversion Formulas for Sequence Generating Functions
Axioms, 2019 The purpose of this note is to provide an expository introduction to some more curious integral formulas and transformations involving generating functions.
Maxie D. Schmidt
doaj +1 more source