Results 1 to 10 of about 281 (82)

Arithmetic completely regular codes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2016
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.
Jacobus Koolen   +3 more
doaj   +4 more sources

On the correspondence of deviances and maximum-likelihood and interval estimates from log-linear to logistic regression modelling. [PDF]

open access: yesR Soc Open Sci, 2020
Funding: The first author would like to acknowledge the support of the School of Mathematics and Statistics, as well as CREEM, at the University of St Andrews, and the University of St Andrews St Leonard’s 7th Century Scholarship.Consider a set of ...
Jing W, Papathomas M.
europepmc   +4 more sources

Tournaments and Even Graphs are Equinumerous [PDF]

open access: yes, 2022
A graph is called \emph{odd} if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges, and \emph{even} otherwise.
Devillers, Alice   +4 more
core   +2 more sources

The intersection graph of a finite simple group has diameter at most 5 [PDF]

open access: yes, 2021
The author was supported by a St Leonard’s International Doctoral Fees Scholarship and a School of Mathematics & Statistics PhD Funding Scholarship at the University of St Andrews.Let G be a non-abelian finite simple group.
Freedman, Saul D.
core   +2 more sources

Cyclic tridiagonal pairs, higher order Onsager algebras and orthogonal polynomials [PDF]

open access: yes, 2016
The concept of cyclic tridiagonal pairs is introduced, and explicit examples are given. For a fairly general class of cyclic tridiagonal pairs with cyclicity N, we associate a pair of `divided polynomials'. The properties of this pair generalize the ones
Baseilhac, P.   +2 more
core   +4 more sources

Multi-agent decision-making dynamics inspired by honeybees [PDF]

open access: yes, 2018
When choosing between candidate nest sites, a honeybee swarm reliably chooses the most valuable site and even when faced with the choice between near-equal value sites, it makes highly efficient decisions.
Franci, Alessio   +3 more
core   +1 more source

On the Communication Requirements of Verifying the VCG Outcome [PDF]

open access: yes, 2010
We consider the amount of communication required to verify the outcome of the Vickrey-Clarke-Groves (VCG) mechanism: an efficient allocation together with incentivizing VCG payments.
Lahaie, Sébastien, Parkes, David C.
core   +3 more sources

Towards Machine Wald [PDF]

open access: yes, 2015
The past century has seen a steady increase in the need of estimating and predicting complex systems and making (possibly critical) decisions with limited information.
A. Ben-Tal   +135 more
core   +2 more sources

Radiative multipole moments of integer-spin fields in curved spacetime [PDF]

open access: yes, 1997
Radiative multipole moments of scalar, electromagnetic, and linearized gravitational fields in Schwarzschild spacetime are computed to third order in v in a weak-field, slow-motion approximation, where v is a characteristic velocity associated with the ...
A. Abramovici   +40 more
core   +2 more sources

Nash's interpretations of equilibrium: Solving the objections to Cournot [PDF]

open access: yes, 2015
A Nash equilibrium can also be seen as a Cournot-Nash equilibrium, though this is debated because Cournot provided a specific application, not a general formulation.
Streb, Jorge M.
core   +1 more source

Home - About - Disclaimer - Privacy