Results 1 to 10 of about 59,986 (267)
Topological Methods for Studying Contextuality: N-Cycle Scenarios and Beyond [PDF]
Entropy, 2023 Simplicial distributions are combinatorial models describing distributions on spaces of measurements and outcomes that generalize nonsignaling distributions on contextuality scenarios.
Aziz Kharoof, Selman Ipek, Cihan Okay
doaj +2 more sources
Combinatorial Inequalities and Subspaces of L1
, 2012 Let M and N be Orlicz functions. We establish some combinatorial inequalities and show that the product spaces l^n_M(l^n_N) are uniformly isomorphic to subspaces of L_1 if M and N are "separated" by a function t^r ...
Prochno, Joscha, Schuett, Carsten
core +2 more sources
A Combinatorial Proof of Fisher’s Inequality [PDF]
Graphs and Combinatorics, 2020 3 ...
Mathew, Rogers, Mishra, Tapas Kumar
openaire +3 more sources
Combinatorial Prophet Inequalities [PDF]
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017 We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibility constraint, we give an $O(1)$-competitive algorithm. For a monotone subadditive objective function over an arbitrary downward-closed feasibility constraint, we give an $O(\
Rubinstein, Aviad, Singla, Sahil
openaire +2 more sources
Bucshbaum simplicial posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 The family of Buchsbaum simplicial posets generalizes the family of simplicial cell manifolds. The $h'-$vector of a simplicial complex or simplicial poset encodes the combinatorial and topological data of its face numbers and the reduced Betti numbers of
Jonathan Browder, Steven Klee
doaj +1 more source
Combinatorial anti-concentration inequalities, with applications [PDF]
Mathematical Proceedings of the Cambridge Philosophical Society, 2021 AbstractWe prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn, we prove some “Poisson-type” anti-concentration theorems that give bounds of the form 1/e+o(1) for the point probabilities of certain ...
Fox, Jacob +2 more
openaire +3 more sources
Grothendieck‐Type Inequalities in Combinatorial Optimization [PDF]
Communications on Pure and Applied Mathematics, 2012 AbstractWe survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity. © 2011 Wiley Periodicals, Inc.
Khot, Subhash, Naor, Assaf
openaire +2 more sources
npj Systems Biology and Applications, 2023 Mathematical modeling of the emergent dynamics of gene regulatory networks (GRN) faces a double challenge of (a) dependence of model dynamics on parameters, and (b) lack of reliable experimentally determined parameters.
Kishore Hari +5 more
doaj +1 more source
Exponential extrapolation memory for tabu search
EURO Journal on Computational Optimization, 2022 Tabu search is a well-established metaheuristic framework for solving hard combinatorial optimization problems. At its core, the method uses different forms of memory to guide a local search through the solution space so as to identify high-quality local
Håkon Bentsen +2 more
doaj +1 more source
Measuring Accessibility to Medical Centers in Isfahan City Using 2SFCA Method [PDF]
جغرافیا و برنامهریزی محیطی, 2023 One of the most important challenges facing policymakers and urban planners in recent decades is the issue of accessibility to a variety of urban services. The main purpose of this study was thecalculation of the accessibility of census blocks to medical
Ansar Gholami +3 more
doaj +1 more source