Minimal scrambling sets of simple orders

DOI10.1007/BF01896428MaRDI QIDQ5652683zbMATH OpenWikidataFDO

Authors Joel Spencer

Publication date 1972

Published in Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01896428

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

• Concerning a Certain Set of Arrangements
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Partition relations for cardinal numbers

Cited in

(59)

• The covering threshold of a directed acyclic graph by directed acyclic subgraphs
• The order dimension of divisibility
• Suitable permutations, binary covering arrays, and Paley matrices
• On covering numbers, Young diagrams, and the local dimension of posets
• On the minimum number of completely 3-scrambling permutations
• Suitable sets of permutations, packings of triples, and Ramsey's theorem
• Poset boxicity of graphs
• Planar graphs and poset dimension
• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• Infinite combinatorial issues raised by lifting problems in universal algebra
• Boolean layer cakes
• Separation dimension of graphs and hypergraphs
• Interval number of special posets and random posets
• The dimension of interior levels of the Boolean lattice
• The order dimension of two levels of the Boolean lattices
• Boxicity of line graphs
• Some bounds on the threshold dimension of graphs
• The fractional dimension of subsets of Boolean lattices and cartesian products
• Incidence posets of trees in posets of large dimension
• Dimensions of hypergraphs
• Boxicity and cubicity of product graphs
• Fractional local dimension
• On locally rainbow colourings
• The dimension of two levels of the Boolean lattice
• The dimension of suborders of the Boolean lattice
• Shattering k-sets with permutations
• On perfect sequence covering arrays
• Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups
• Embedding finite posets in cubes
• The maximum number of edges in a graph of bounded dimension, with applications to ring theory
• The order dimension of the complete graph
• Perfect and nearly perfect separation dimension of complete and random graphs
• Fractional dimension of partial orders
• Improved bounds for the dimension of divisibility
• Constraints on the applicability range of Hill's criterion: strong orthotropy or transverse isotropy
• On the order dimension of 1-sets versus k-sets
• On graphs embeddable in a layer of a hypercube and their extremal numbers
• The random binary growth model
• Largest minimal inversion-complete and pair-complete sets of permutations
• On the order dimension of convex polytopes
• Covering line graphs with equivalence relations
• Comparing Dushnik-Miller dimension, Boolean dimension and local dimension
• Excess coverage arrays and Levenshtein's conjecture
• Parametrization of knowledge structures
• An infinite combinatorial statement with a poset parameter
• Boxicity of graphs on surfaces
• Orthogonal surfaces and their CP-orders
• On the dimensions of ordered sets of bounded degree
• Perfect sequence covering arrays
• Computational aspects of relaxation complexity: possibilities and limitations
• Better bounds for poset dimension and boxicity
• Constructions and nonexistence results for suitable sets of permutations
• The dimension of divisibility orders and multiset posets
• Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
• A group-based structure for perfect sequence covering arrays
• Growth of the perfect sequence covering array number
• Sequence Covering Arrays and Linear Extensions
• A polynomial construction of perfect sequence covering arrays
• Regularity of an abstract Wiener integral

This page was built for publication: Minimal scrambling sets of simple orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652683)