Arithmetical properties of permutations of integers
From MaRDI portal
Publication:1053743
DOI10.1007/BF01994075zbMath0518.10063OpenAlexW2031583134MaRDI QIDQ1053743
Norbert Hegyvári, Robert Freud
Publication date: 1983
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01994075
Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Density, gaps, topology (11B05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (10)
Finding structure in sequences of real numbers via graph theory: a problem list ⋮ Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel ⋮ Brief survey on divisor graphs and divisor function graphs ⋮ Study of the divisor graph. IV ⋮ The permutation of integers with small least common multiple of two subsequent terms ⋮ When zero-divisor graphs are divisor graphs ⋮ The EKG Sequence ⋮ Complete tripartite subgraph in the coprime graphs of integers ⋮ On sums of subsequent terms of permutations ⋮ Characterizing which powers of hypercubes and folded hypercubes are divisor graphs
Cites Work
This page was built for publication: Arithmetical properties of permutations of integers
