Minimal scrambling sets of simple orders

DOI10.1007/BF01896428zbMATH Open0242.05001WikidataQ29999040 ScholiaQ29999040MaRDI QIDQ5652683FDOQ5652683

Joel Spencer

Publication date: 1972

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

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

Cited In (56)

• On locally rainbow colourings
• Shattering \(k\)-sets with permutations
• Perfect and nearly perfect separation dimension of complete and random graphs
• Improved bounds for the dimension of divisibility
• On graphs embeddable in a layer of a hypercube and their extremal numbers
• The dimension of divisibility orders and multiset posets
• The covering threshold of a directed acyclic graph by directed acyclic subgraphs
• The order dimension of divisibility
• 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
• Boolean layer cakes
• Infinite combinatorial issues raised by lifting problems in universal algebra
• Interval number of special posets and random posets
• Separation dimension of graphs and hypergraphs
• The dimension of interior levels of the Boolean lattice
• The order dimension of two levels of the Boolean lattices
• Boxicity of line graphs
• The fractional dimension of subsets of Boolean lattices and cartesian products
• Boxicity and cubicity of product graphs
• Incidence posets of trees in posets of large dimension
• Dimensions of hypergraphs
• Fractional local dimension
• On perfect sequence covering arrays
• The dimension of two levels of the Boolean lattice
• The dimension of suborders of the Boolean lattice
• Suitable Permutations, Binary Covering Arrays, and Paley Matrices
• 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
• Fractional dimension of partial orders
• On the order dimension of 1-sets versus \(k\)-sets
• Constraints on the applicability range of Hill's criterion: strong orthotropy or transverse isotropy
• 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
• On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
• Parametrization of knowledge structures
• Boxicity of graphs on surfaces
• An infinite combinatorial statement with a poset parameter
• Orthogonal surfaces and their CP-orders
• On the dimensions of ordered sets of bounded degree
• Better bounds for poset dimension and boxicity
• Computational aspects of relaxation complexity: possibilities and limitations
• Perfect sequence covering arrays
• Constructions and nonexistence results for suitable sets of permutations
• 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
• A polynomial construction of perfect sequence covering arrays
• Sequence Covering Arrays and Linear Extensions
• 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)