vix.ing · top · new · best · stats · spec

On GCD-morphic sequences

2008/02/10 by Maciej Dziemiańczuk, M. Dziemiańczuk, Dziemiańczuk, M. +2 · 3 citations
Computer Science · Mathematics · #05A10 #05C20 #06A07 #11A41 #Analytic Number Theory Research #Coding theory and cryptography #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:05A10 #msc:05C20 #msc:06A07 #msc:11A41

paper · pdf · doi:10.48550/arxiv.0802.1303

arxiv created 2008/02/10 · openalex publication_date 2008/02/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note is a response to one of the problems posed by Kwaśniewski in [1,2], see also [3] i.e. GCD-morphic Problem III. We show that any GCD-morphic sequence F is at the point product of primary GCD-morphic sequences and any GCD-morphic sequence is encoded by natural number valued sequence satisfying condition (C1). The problem of general importance - for example in number theory was formulated in [1,2] while investigating a new class of DAG's and their correspondent p.o. sets encoded uniquely by sequences with combinatorially interpretable properties.

Cited by

Related