Results 101 to 110 of about 159 (130)
ON THE SIZE OF MINIMUM SUPER ARROVIAN DOMAINS ∗
. Arrow’s celebrated impossibility theorem states that a sufficiently diverse domain of voter preference profiles cannot be mapped into social orders of the alternatives without violating at least one of three appealing conditions. Following Fishburn and
Samit Dasgupta
core
Genetic snapshots of the Rhizobium species NGR234 genome. [PDF]
Viprey V +3 more
europepmc +1 more source
The visibility parameter for words and permutations
Cristea Ligia, Prodinger Helmut
doaj +1 more source
Capacities: From Information Theory to Extremal Set Theory
Generalizing the concept of zero--error capacity beyond its traditional links to any sort of information transmission we give an asymptotic solution to several hard problems in extremal set theory within a unified, formally information--theoretic ...
J. Körner, L. Gargano, U. Vaccaro
core
Monotonic Subsequences in Dimensions Higher Than One
The 1935 result of Erdos and Szekeres that any sequence of n 2 +1 real numbers contains a monotonic subsequence of n + 1 terms has stimulated extensive further research, including a paper of J. B. Kruskal that defined an extension of monotonicity for
A. M. Odlyzko, J. B. Shearer, R. Siders
core
Genome rearrangements as double coset Markov chains. [PDF]
Simper MA.
europepmc +1 more source
A combinatorial proof of a result for permutation pairs
Mansour Toufik, Shattuck Mark
doaj +1 more source
Parity Property of Hexagonal Sliding Puzzles. [PDF]
Estévez M, Karpman R, Roldán É.
europepmc +1 more source
Nonadaptive search problem with sets of equal sum
Kolev Emil
doaj +1 more source
Parity-alternating permutations and successions
Munagi Augustine
doaj +1 more source

