On Universal Cycles for K-Subsets of an N-Set

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/s0895480191220861
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Universal Cycles for (N-1)-Partitions of AN N-Set

English

Universal and Near-Universal Cycles of Set Partitions

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2015English

On Universal Cycles for Multisets

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

SET: An Algorithm for Distributed Multirobot Task Allocation With Dynamic Negotiation Based on Task Subsets

Proceedings - IEEE International Conference on Robotics and Automation
ControlSystems EngineeringElectronic EngineeringElectricalArtificial IntelligenceSoftware
2007English

On Sums of Subsets of a Set of Integers

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1988English

Universal Spaces for $(K, \Overline{k})-$ Surfaces

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Adding Small Sets to an N-Set

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1995English

BINARY GOLDBACH-EULER PROBLEM IN THE SET Θ = {6k ±1/K∈N}

International Journal of Applied and Fundamental Research (Международный журнал прикладных и фундаментальных исследований)
2016English

The Mandelbrot Set Is Universal

2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy