Minimal scrambling sets of simple orders

DOI10.1007/BF01896428zbMath0242.05001WikidataQ29999040 ScholiaQ29999040MaRDI QIDQ5652683

J. H. Spencer

Publication date: 1972

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (52)

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

Cites Work

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

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