New recursive constructions of amoebas and their balancing number

IF 0.9 3区 数学 Q2 MATHEMATICS
Laura Eslava, Adriana Hansberg, Tonatiuh Matos-Wiederhold, Denae Ventura
{"title":"New recursive constructions of amoebas and their balancing number","authors":"Laura Eslava,&nbsp;Adriana Hansberg,&nbsp;Tonatiuh Matos-Wiederhold,&nbsp;Denae Ventura","doi":"10.1007/s00010-025-01156-7","DOIUrl":null,"url":null,"abstract":"<div><p>Amoeba graphs are based on iterative <i>feasible edge-replacements</i>, where, at each step, an edge from the graph is removed and placed in an available spot so that the resulting graph is isomorphic to the original graph. Broadly speaking, amoebas are graphs that, by means of a chain of feasible edge-replacements, can be transformed into any other copy of itself on a given vertex set (depending on which they are defined as local or global amoebas). Global amoebas were born as examples of <i>balanceable</i> graphs, which appear with half of their edges in each color in any 2-edge coloring of a large enough complete graph with a sufficient amount of edges <i>k</i> in each color. The minimum value of <i>k</i> is called the <i>balancing number</i> of <i>G</i>. We provide a recursive construction to generate very diverse infinite families of local and global amoebas, which not only answers a question posed by Caro et al. but also yields an efficient algorithm that provides a chain of feasible edge-replacements that one can perform in order to move a local amoeba into an aimed copy in the same vertex set. All results are illustrated by three different families of local amoebas, including the Fibonacci-type trees. We express the balancing number of a global amoeba <i>G</i> in terms of the extremal number of a class of subgraphs of <i>G</i> and give a general lower bound. We provide linear lower and upper bounds for the balancing number of our three case studies.</p></div>","PeriodicalId":55611,"journal":{"name":"Aequationes Mathematicae","volume":"99 3","pages":"1265 - 1299"},"PeriodicalIF":0.9000,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aequationes Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00010-025-01156-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Amoeba graphs are based on iterative feasible edge-replacements, where, at each step, an edge from the graph is removed and placed in an available spot so that the resulting graph is isomorphic to the original graph. Broadly speaking, amoebas are graphs that, by means of a chain of feasible edge-replacements, can be transformed into any other copy of itself on a given vertex set (depending on which they are defined as local or global amoebas). Global amoebas were born as examples of balanceable graphs, which appear with half of their edges in each color in any 2-edge coloring of a large enough complete graph with a sufficient amount of edges k in each color. The minimum value of k is called the balancing number of G. We provide a recursive construction to generate very diverse infinite families of local and global amoebas, which not only answers a question posed by Caro et al. but also yields an efficient algorithm that provides a chain of feasible edge-replacements that one can perform in order to move a local amoeba into an aimed copy in the same vertex set. All results are illustrated by three different families of local amoebas, including the Fibonacci-type trees. We express the balancing number of a global amoeba G in terms of the extremal number of a class of subgraphs of G and give a general lower bound. We provide linear lower and upper bounds for the balancing number of our three case studies.

阿米巴虫的新递归结构及其平衡数
阿米巴图是基于迭代可行的边替换,其中,在每一步,从图中删除一条边,并放置在一个可用的位置,使结果图是同构的原始图。从广义上讲,阿米巴是这样一种图,通过一系列可行的边替换,可以在给定的顶点集上转换成自身的任何其他副本(取决于它们被定义为局部或全局阿米巴)。全局变形虫是作为可平衡图的例子诞生的,在一个足够大的、每种颜色有足够数量的边k的完全图的任何2边着色中,每种颜色都有一半的边。k的最小值被称为g的平衡数。我们提供了一个递归结构来生成非常多样化的局部和全局阿米巴的无限族,这不仅回答了Caro等人提出的问题,而且还产生了一个有效的算法,提供了一个可行的边替换链,人们可以执行,以便将局部阿米巴移动到同一顶点集中的目标副本中。所有的结果都用三个不同的当地阿米巴原虫科来说明,包括斐波那契型树。用G的一类子图的极值数表示了全局变形虫G的平衡数,并给出了它的一般下界。我们为三个案例研究的平衡数量提供了线性的下限和上限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Aequationes Mathematicae
Aequationes Mathematicae MATHEMATICS, APPLIED-MATHEMATICS
CiteScore
1.70
自引率
12.50%
发文量
62
审稿时长
>12 weeks
期刊介绍: aequationes mathematicae is an international journal of pure and applied mathematics, which emphasizes functional equations, dynamical systems, iteration theory, combinatorics, and geometry. The journal publishes research papers, reports of meetings, and bibliographies. High quality survey articles are an especially welcome feature. In addition, summaries of recent developments and research in the field are published rapidly.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信