Asymptotic enumeration (05A16) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Generalized primes and integers (11N80) Matrices of integers (15B36) Systems of functional equations and inequalities (39B72) Interval and finite arithmetic (65G30) Rounding, estimation, theory of errors (educational aspects) (97N20)
Abstract: A positive integer is a floor quotient of if there is a positive integer such that . The floor quotient relation defines a partial order on the positive integers. The paper studies the internal structure of this partial order and its M"{o}bius function.
Cites work
- A Variant of Möbius Inversion
- Cardinality of a floor function set
- Dilated Floor Functions That Commute
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4027488 (Why is no real title available?)
- scientific article; zbMATH DE number 1024386 (Why is no real title available?)
- scientific article; zbMATH DE number 3003467 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- Incidence functions as generalized arithmetic functions. I
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On the maximal order of numbers in the ``factorisatio numerorum problem
- Structure of incidence algebras and their automorphism groups
- Symmetric matrices related to the Mertens function
- THE EULERIAN FUNCTIONS OF A GROUP
This page was built for publication: The floor quotient partial order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144419)