Quantitative invertibility of random matrices: a combinatorial perspective
Discrete Analysis, 2021 Quantitative invertibility of random matrices: a combinatorial perspective, Discrete Analysis 2021:10, 38 pp. This paper concerns the general and much studied question of how likely a large random real or complex square matrix is to be invertible, and ...
Vishesh Jain
doaj +1 more source
Multivariate Boundaries of a Self Representing Stratum of Large Units in Agricultural Survey Design
Survey Research Methods, 2012 In business surveys in general, and in multipurpose agricultural surveys in particular, the problem of designing a sample from a list frame usually consists of two different aspects.
Roberto Benedetti, Federica Piersimoni
doaj +1 more source
THE ANALYSIS OF IMAGES OF A CIRCULAR SOURCE IN N-POINT GRAVITATIONAL LENSES
Odessa Astronomical Publications, 2018 Currently, in the field of computer processing, there are difficulties. When processing astrophysical experimental data, the difficulties are connected, on the one hand, with a large amount of information that requires processing, and, on the other hand,
S. D. Bronza +2 more
doaj +1 more source
Group field theories for all loop quantum gravity
New Journal of Physics, 2015 Group field theories represent a second quantized reformulation of the loop quantum gravity state space and a completion of the spin foam formalism. States of the canonical theory, in the traditional continuum setting, have support on graphs of arbitrary
Daniele Oriti +2 more
doaj +1 more source
Algorithmic approach, mathematical modelling and network applications of connected certified domination in graphs: A comprehensive review [PDF]
EPJ Web of ConferencesIn this study we have reviewed a very important variant of graph domination theory that is connected certified domination (CCD) and also presents CCD as graph-based model for network optimization.
Nehe Reshma +2 more
doaj +1 more source
A fast approximation algorithm for solving the complete set packing problem
, 2014 We study the complete set packing problem (CSPP) where the family of feasible subsets may include all possible combinations of objects. This setting arises in applications such as combinatorial auctions (for selecting optimal bids) and cooperative game ...
Nguyen, Tri-Dung
core +1 more source
Testing BOI and BOB algorithms for solving the Winner Determination [PDF]
, 2008 Eighth International Conference on Hybrid Intelligent Systems, 2008. HIS '08. Barcelona, 10-12 September 2008Combinatorial auctions are a promising auction format for allocating radio spectrum, as well as other goods.
Sáez, Yago +9 more
core +1 more source
Discrete Analysis, 2023 Limits of Latin squares, Discrete Analysis 2023:8, 66 pp. There has been a great deal of work over the last fifteen to twenty years on the theme of continuous limits of discrete combinatorial objects. In particular, any sequence of graphs of increasing
Frederik Garbe +3 more
doaj +1 more source
Recovering General Relativity from a Planck Scale Discrete Theory of Quantum Gravity
Philosophy of PhysicsAn argument is presented that if a theory of quantum gravity is physically discrete at the Planck scale and the theory recovers General Relativity as an approximation, then, at the current stage of our knowledge, causal sets must arise within the theory,
Jeremy Butterfield, Fay Dowker
doaj +1 more source
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
Entropy, 2018 In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou +1 more
doaj +1 more source