A recursive algorithm of combinatorial difference set design for least scale number on ruler

For a positive integer n≥2, what is the minimum number of ticks to be engraved on an unscaled ruler of length n to measure all lengths from 1 to n. This is an unsolved problem of ruler with least number of scales. This paper clarifies the relationship between ruler with the least number of scales an...

Full description

Saved in:
Bibliographic Details
Published in:Zhejiang da xue xue bao. Journal of Zhejiang University. Sciences edition. Li xue ban Vol. 51; no. 2; pp. 178 - 185
Main Authors: Tang, Baoxiang, Ren, Han
Format: Journal Article
Language:Chinese
Published: Hangzhou Zhejiang University 01.03.2024
Zhejiang University Press
Subjects:
Algorithms
Combinatorial analysis
combinatorial difference recursive algorithm(组合差集递推算法)
Engraving
graceful labeling algorithm(优美标号算法)
graceful labeling(优美标号)
Graph theory
minimal graceful graph(极小优美图)
ruler with least number of scales(最省刻度尺)
Ticks
ISSN:1008-9497
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract For a positive integer n≥2, what is the minimum number of ticks to be engraved on an unscaled ruler of length n to measure all lengths from 1 to n. This is an unsolved problem of ruler with least number of scales. This paper clarifies the relationship between ruler with the least number of scales and the minimal graceful graph, and a combined difference recursive algorithm for calculating all the least scale values ​​of ruler with the least number of scales is given. This algorithm calculates that the length is 3 to all the minimum scale values ​​of the most scale-saving ruler of 40, and combined with the graph theory model, the minimum scale values ​​of ruler with least number of scales with lengths from 41 to 82 are given.
AbstractList For a positive integer n≥2, what is the minimum number of ticks to be engraved on an unscaled ruler of length n to measure all lengths from 1 to n. This is an unsolved problem of ruler with least number of scales. This paper clarifies the relationship between ruler with the least number of scales and the minimal graceful graph, and a combined difference recursive algorithm for calculating all the least scale values ​​of ruler with the least number of scales is given. This algorithm calculates that the length is 3 to all the minimum scale values ​​of the most scale-saving ruler of 40, and combined with the graph theory model, the minimum scale values ​​of ruler with least number of scales with lengths from 41 to 82 are given.
For a positive integer n≥2, what is the minimum number of ticks to be engraved on an unscaled ruler of length n to measure all lengths from 1 to n. This is an unsolved problem of ruler with least number of scales. This paper clarifies the relationship between ruler with the least number of scales and the minimal graceful graph, and a combined difference recursive algorithm for calculating all the least scale values of ruler with the least number of scales is given. This algorithm calculates that the length is 3 to all the minimum scale values of the most scale-saving ruler of 40, and combined with the graph theory model, the minimum scale values of ruler with least number of scales with lengths from 41 to 82 are given.(在长度为n（n≥2为正整数）的直尺上最少刻多少个刻度就能度量1到n的所有长度，这便是至今未解决的最省刻度尺问题。阐明了最省刻度尺与极小优美图之间的关系，给出了计算最省刻度尺的所有最省刻度值的组合差集递推算法，得到长度为3~40的最省刻度尺的所有最省刻度值，同时，结合图论模型，给出了长度为41~82的最省刻度尺的最省刻度值。)
Author Ren, Han
Tang, Baoxiang
Author_xml – sequence: 1
  givenname: Baoxiang
  surname: Tang
  fullname: Tang, Baoxiang
– sequence: 2
  givenname: Han
  surname: Ren
  fullname: Ren, Han
BookMark eNo9j0tLxDAUhbNQUEf_Q0C3U2_apE2Ww-BjYMDNLIWSx82YoU00aQX_vUXF1YUPznfOvSJnMUUk5I5B1XRS3J-qUEqsGIBcK666qoaaV1BXAO0ZufznF-SmlGAAGAhWK3lJXjc0o51zCZ9I9XBMOUxvI02e2jSaEPW0ED1QF7zHjNEiLThRhyUcI_Up0wF1mWixekAa59FgpinSPA-Yr8m510PBm7-7IofHh8P2eb1_edptN_u1U7xZm5or0cjONhZd64y0YKTyTHqNRuHyoFRWuq6zplXeg-haz1vkYIWzsMRWZPerdUmf-vccRp2_-qRD_wNSPvY6T8EO2DuhBILRrFWGMyGU4qL2yBhHg0vb4rr9db3n9DFjmfpTmnNc1vcNdIKDANk0362vct4
ContentType Journal Article
Copyright Copyright Zhejiang University 2024
Copyright_xml – notice: Copyright Zhejiang University 2024
DBID 7SC
7SP
7TB
7U5
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DOA
DOI 10.3785/j.issn.1008-9497.2024.02.006
DatabaseName Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Solid State and Superconductivity Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Open Access: DOAJ - Directory of Open Access Journals
DatabaseTitle Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Solid State and Superconductivity Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Civil Engineering Abstracts
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EndPage 185
ExternalDocumentID oai_doaj_org_article_d595e0ba169b415599452fe114ebeeb9
GroupedDBID 7SC
7SP
7TB
7U5
8FD
ALMA_UNASSIGNED_HOLDINGS
FR3
GROUPED_DOAJ
JQ2
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-d943-b2495387c3ced6db8c0b89f18faeb9e37889c8d77cb69ff0576f46e40c5dc07c3
IEDL.DBID DOA
ISSN 1008-9497
IngestDate Tue Oct 14 19:09:15 EDT 2025
Tue Nov 18 16:11:09 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language Chinese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d943-b2495387c3ced6db8c0b89f18faeb9e37889c8d77cb69ff0576f46e40c5dc07c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-1631-1482
OpenAccessLink https://doaj.org/article/d595e0ba169b415599452fe114ebeeb9
PQID 3075405083
PQPubID 2047852
PageCount 8
ParticipantIDs doaj_primary_oai_doaj_org_article_d595e0ba169b415599452fe114ebeeb9
proquest_journals_3075405083
PublicationCentury 2000
PublicationDate 20240301
2024-03-01
PublicationDateYYYYMMDD 2024-03-01
PublicationDate_xml – month: 03
  year: 2024
  text: 20240301
  day: 01
PublicationDecade 2020
PublicationPlace Hangzhou
PublicationPlace_xml – name: Hangzhou
PublicationTitle Zhejiang da xue xue bao. Journal of Zhejiang University. Sciences edition. Li xue ban
PublicationYear 2024
Publisher Zhejiang University
Zhejiang University Press
Publisher_xml – name: Zhejiang University
– name: Zhejiang University Press
SSID ssib001051298
ssib051373732
ssib002258177
ssib004369313
ssib008679801
ssib002476865
ssib023167501
ssib059160192
ssib000948450
ssib002040240
ssib001104615
ssib000969734
ssib008143637
ssib006704891
ssj0002507526
Score 2.3777924
Snippet For a positive integer n≥2, what is the minimum number of ticks to be engraved on an unscaled ruler of length n to measure all lengths from 1 to n. This is an...
SourceID doaj
proquest
SourceType Open Website
Aggregation Database
StartPage 178
SubjectTerms Algorithms
Combinatorial analysis
combinatorial difference recursive algorithm(组合差集递推算法)
Engraving
graceful labeling algorithm(优美标号算法)
graceful labeling(优美标号)
Graph theory
minimal graceful graph(极小优美图)
ruler with least number of scales(最省刻度尺)
Ticks
Title A recursive algorithm of combinatorial difference set design for least scale number on ruler
URI https://www.proquest.com/docview/3075405083
https://doaj.org/article/d595e0ba169b415599452fe114ebeeb9
Volume 51
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  issn: 1008-9497
  databaseCode: DOA
  dateStart: 20220101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.doaj.org/
  omitProxy: false
  ssIdentifier: ssj0002507526
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  issn: 1008-9497
  databaseCode: M~E
  dateStart: 19990101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: false
  ssIdentifier: ssib059160192
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV2_axRBFB4kiNiIomI0yhQpYrFmd-d3GSXBxpAiRbpldnbWRM472btYWEiEIKmCBIKgaWzE6hAshAT8b_Yu-S98b_fuHLCwkYWF3WFZmHlv3vfmzXwfIYumzBmz2kaJ8A4SFGkjwyyPnNVgHqkueGwbsQm1vq63tsxGIPWFe8JaeuC245YLYYSPc5tIk2PwM4aLtPQA4-H3Pm-O7sXKBMlUCxy45mG9zkijQiK0GANdUC_CUmcQGFOw7ZSHJ0SFTlSY2ABMD-uDTBoWBEapwDMCFhoNsEQGQABp7nQ8a0_xPLr48ywSpuBKZ6tFAFSUaLTjkIwnMtyoK2QRU26lxfKLZsJ4NGuCtDflLRXpVIvgr1DTxM-16-TaBPjSlbbDb5BLb7ZvksMVWuGCP-6hp7bzvFftDLZf0l5JwREgZ8cVAXAQOpVxcZ72_YAWzbYTCnibdlB7iPbB0jxt1U1or0ur3Y6vlkYne-OTd_XBWX36tf5-ej78dT78Mv60Pz7brz8c1D-HF5_fX-wdjQ6_jYcfRz-OH94im2urm0-eRhOFiKgwnEU5CmczrRxzHoWxtItzbcpElxYswyNVvnG6UMrl0pQlQFNZcul57EThYvjsNpnr9rr-DqFW58LquID8UXCfSrC13EtuuOQJIDwxTx5jN2avWg6QDFm5mxdgq9nEVrN_2eo8WZgOQjaZKvoZTLKImgEK3_0f_7hHruLot9vkFsjcoNr198ll93qw068eNF4C92dvV38DRGcRmQ
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+recursive+algorithm+of+combinatorial+difference+set+design+for+least+scale+number+on+ruler%28%E6%9C%80%E7%9C%81%E5%88%BB%E5%BA%A6%E5%B0%BA%E8%AE%BE%E8%AE%A1%E7%9A%84%E7%BB%84%E5%90%88%E5%B7%AE%E9%9B%86%E9%80%92%E6%8E%A8%E7%AE%97%E6%B3%95%29&rft.jtitle=Zhejiang+da+xue+xue+bao.+Journal+of+Zhejiang+University.+Sciences+edition.+Li+xue+ban&rft.au=%E5%94%90%E4%BF%9D%E7%A5%A5%28TANG+Baoxiang%29&rft.au=%E4%BB%BB%E9%9F%A9%28REN+Han%29&rft.date=2024-03-01&rft.pub=Zhejiang+University+Press&rft.issn=1008-9497&rft.volume=51&rft.issue=2&rft.spage=178&rft.epage=185&rft_id=info:doi/10.3785%2Fj.issn.1008-9497.2024.02.006&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_d595e0ba169b415599452fe114ebeeb9
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1008-9497&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1008-9497&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1008-9497&client=summon