离散数学期刊(英文)最新文献

筛选
英文 中文
Toric Heaps, Cyclic Reducibility, and Conjugacy in Coxeter Groups Coxeter群中的Toric堆、循环可还原性和共轭性
离散数学期刊(英文) Pub Date : 2019-09-18 DOI: 10.4236/ojdm.2019.94010
Shi Chao, M. Macauley
{"title":"Toric Heaps, Cyclic Reducibility, and Conjugacy in Coxeter Groups","authors":"Shi Chao, M. Macauley","doi":"10.4236/ojdm.2019.94010","DOIUrl":"https://doi.org/10.4236/ojdm.2019.94010","url":null,"abstract":"In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49625410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalizations of the Feline and Texas Chainsaw Josephus Problems Feline和Texas Chainsaw Josephus问题的推广
离散数学期刊(英文) Pub Date : 2019-08-09 DOI: 10.4236/ojdm.2019.94011
David Ariyibi, Kevin L. Chang, P. Harris
{"title":"Generalizations of the Feline and Texas Chainsaw Josephus Problems","authors":"David Ariyibi, Kevin L. Chang, P. Harris","doi":"10.4236/ojdm.2019.94011","DOIUrl":"https://doi.org/10.4236/ojdm.2019.94011","url":null,"abstract":"We define and study the Extended Feline Josephus Game, a game in which n players, each with l lives, stand in a circle. The game proceeds by alternating between hitting k consecutive players—each of whom will consequently lose a life—and skipping s consecutive players. This cycle continues until every player except one loses all of their lives. Given the nonnegative integer parameters n, k, s and l, the goal of the game is to identify the surviving player. In this paper, we show how the defining parameters n, k, s, and l affect the survivor of games with specific constraints on those parameters and our main results provide new closed formulas to determine the survivor of these Extended Feline Josephus Games. Moreover, for cases where these formulas do not apply, we provide recursive formulas for reducing the initial game to other games with smaller parameter values. For the interested reader, we present a variety of directions for future work in this area, including an extension which considers players lying on a general graph, rather than on a circle.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43719615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Game Chromatic Number of Some Regular Graphs 若干正则图的游戏色数
离散数学期刊(英文) Pub Date : 2019-08-09 DOI: 10.4236/ojdm.2019.94012
Ramy S. Shaheen, Z. Kanaya, Khaled Alshehada
{"title":"Game Chromatic Number of Some Regular Graphs","authors":"Ramy S. Shaheen, Z. Kanaya, Khaled Alshehada","doi":"10.4236/ojdm.2019.94012","DOIUrl":"https://doi.org/10.4236/ojdm.2019.94012","url":null,"abstract":"Let G be a graph and k be a positive integer. We consider a game with two players Alice and Bob who alternate in coloring the vertices of G with a set of k colors. In every turn, one vertex will be chosen by one player. Alice’s goal is to color all vertices with the k colors, while Bob’s goal is to prevent her. The game chromatic number denoted by χg(G), is the smallest k such that Alice has a winning strategy with k colors. In this paper, we determine the game chromatic number χg of circulant graphs Cn(1,2), , and generalized Petersen graphs GP(n,2), GP(n,3).","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41521178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Reconstruction of 2-Convex Polyominoes with Non-Empty Corners 非空角2-凸多项式的重构
离散数学期刊(英文) Pub Date : 2019-08-09 DOI: 10.4236/OJDM.2019.94009
K. Tawbe, S. Mansour
{"title":"Reconstruction of 2-Convex Polyominoes with Non-Empty Corners","authors":"K. Tawbe, S. Mansour","doi":"10.4236/OJDM.2019.94009","DOIUrl":"https://doi.org/10.4236/OJDM.2019.94009","url":null,"abstract":"This paper uses the theoretical material developed in a previous study by the authors in order to reconstruct a subclass of 2-convex polyominoes called where the upper left corner and the lower right corner of the polyomino contain each only one cell. The main idea is to control the shape of these polyominoes by using 32 types of geometries. Some modifications are made in the reconstruction algorithm of Chrobak and Durr for HV-convex polyominoes in order to impose these geometries.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44951019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Ordinal Interpretation of the Integers and Its Use in Number Theory 整数的序数解释及其在数论中的应用
离散数学期刊(英文) Pub Date : 2019-08-09 DOI: 10.4236/ojdm.2019.94013
Nathan Hamlin
{"title":"The Ordinal Interpretation of the Integers and Its Use in Number Theory","authors":"Nathan Hamlin","doi":"10.4236/ojdm.2019.94013","DOIUrl":"https://doi.org/10.4236/ojdm.2019.94013","url":null,"abstract":"The author recently published a paper which claimed that an ordinal interpretation of numbers had limited applicability for cryptography. A further examination of this subject, in particular to what extent an ordinal interpretation is useful for recurrence sequences, is needed. Hilbert favored an interpretation of the natural numbers that placed their ordinal properties prior to their cardinal properties [1] [2]. The author examines ordinal uses of the integers in number theory in order to discuss the possibilities and limitations of this approach. The author hopes this paper will be useful in clarifying or even correcting some matters that were discussed in his paper of January of 2018. I was trained informally in philosophical realism, and while I think idealism too has a place, at this time in my life I believe that the weight of evidence and usefulness is more on the side of philosophical materialism. I hope this discussion will help supplement for my readers the material in Number in Mathematical Cryptography. I still maintain that a lack of clarity on these matters has hindered progress in cryptography; and it has taken time for me to better understand these things. I hope others who have interest and ability will assist in making these matters clearer. My intention was to work in pure mathematics, and the transition to an applied mindset was difficult for me. As a result, I feel most comfortable in a more middle-of-the road attitude, but have had to slowly move to a more precise analysis of the physical quantities involved. I hope my readers will be patient with my terminology, which is still evolving, and my discussion of things which are more indirectly related, and which are necessary for my expression. These are important things for the mathematical community to understand, and I hope smarter and more knowledgeable people will address my errors, and improve upon the things I might have correct. I am discussing sequences which are sometimes a use of both ordinal and cardinal numbers.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43797327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Infinite Sets of Solutions and Almost Solutions of the Equation N⋅M = reversal(N⋅M) II 方程N·M=逆(N·M)II的无穷集解和概解
离散数学期刊(英文) Pub Date : 2019-07-08 DOI: 10.4236/OJDM.2019.93007
V. Nitica, Premalata Junius
{"title":"Infinite Sets of Solutions and Almost Solutions of the Equation N⋅M = reversal(N⋅M) II","authors":"V. Nitica, Premalata Junius","doi":"10.4236/OJDM.2019.93007","DOIUrl":"https://doi.org/10.4236/OJDM.2019.93007","url":null,"abstract":"Motivated by their intrinsic interest and by applications to the study of numeric palindromes and other sequences of integers, we discover infinite sets of solutions and almost solutions of the equation N ⋅ M=reversal (N ⋅ M). Most of our results are valid in a general numeration base.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47484947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Domination and Eternal Domination of Jahangir Graph Jahangir图的支配与永恒支配
离散数学期刊(英文) Pub Date : 2019-07-08 DOI: 10.4236/OJDM.2019.93008
Ramy S. Shaheen, Mohammad Assaad, Ali Kassem
{"title":"Domination and Eternal Domination of Jahangir Graph","authors":"Ramy S. Shaheen, Mohammad Assaad, Ali Kassem","doi":"10.4236/OJDM.2019.93008","DOIUrl":"https://doi.org/10.4236/OJDM.2019.93008","url":null,"abstract":"In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. We consider the “all guards move” of the eternal dominating set problem. In which one guard has to move to the attacked vertex and all the remaining guards are allowed to move to an adjacent vertex or stay in their current position after each attack. If the new formed set of guards is still a dominating set of the graph then we successfully defended the attack. Our goal is to find the minimum number of guards required to eternally protect the graph. We call this number the m-eternal domination number and we denote it by . In this paper we find the eternal domination number of Jahangir graph Js,m for s=2,3 and arbitrary m. We also find the domination number for J3,m .","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45129913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Irreducible Polynomials in Ζ[x] That Are Reducible Modulo All Primes Γ[x]中可约模的不可约多项式
离散数学期刊(英文) Pub Date : 2019-04-02 DOI: 10.4236/OJDM.2019.92006
Shiv Gupta
{"title":"Irreducible Polynomials in Ζ[x] That Are Reducible Modulo All Primes","authors":"Shiv Gupta","doi":"10.4236/OJDM.2019.92006","DOIUrl":"https://doi.org/10.4236/OJDM.2019.92006","url":null,"abstract":"The polynomial x4+1 is irreducible in Ζ[x] but is locally reducible, that is, it factors modulo p for all primes p. In this paper we investigate this phenomenon and prove that for any composite natural number N there are monic irreducible polynomials in Ζ[x] which are reducible modulo every prime.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41374869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
2-Convex Polyominoes: Non-Empty Corners 2-凸多元醇:非空角
离散数学期刊(英文) Pub Date : 2019-03-07 DOI: 10.4236/OJDM.2019.92005
K. Tawbe, Nadine J. Ghandour, A. Atwi
{"title":"2-Convex Polyominoes: Non-Empty Corners","authors":"K. Tawbe, Nadine J. Ghandour, A. Atwi","doi":"10.4236/OJDM.2019.92005","DOIUrl":"https://doi.org/10.4236/OJDM.2019.92005","url":null,"abstract":"A polyomino P is called 2-convex if for every two cells there exists a monotone path included in P with at most two changes of direction. This paper studies the geometrical properties of a sub-class of 2-convex polyominoes called where the upper left corner and the lower right corner of the polyomino each contains only one cell.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43340735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Ordering of Unicyclic Graphs with Perfect Matchings by Minimal Matching Energies 基于最小匹配能量的完美匹配单环图排序
离散数学期刊(英文) Pub Date : 2019-01-28 DOI: 10.4236/OJDM.2019.91004
Jianming Zhu
{"title":"Ordering of Unicyclic Graphs with Perfect Matchings by Minimal Matching Energies","authors":"Jianming Zhu","doi":"10.4236/OJDM.2019.91004","DOIUrl":"https://doi.org/10.4236/OJDM.2019.91004","url":null,"abstract":"In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let u and v be the non-isolated vertices of the graphs G and H with the same order, respectively. Let wi be a non-isolated vertex of graph Gi where i=1, 2, …, k. We use Gu(k) (respectively, Hv(k)) to denote the graph which is the coalescence of G (respectively, H) and G1, G2,…, Gk by identifying the vertices u (respectively, v) and w1, w2,…, wk. In this paper, we first present a new technique of directly comparing the matching energies of Gu(k) and Hv(k), which can tackle some quasi-order incomparable problems. As the applications of the technique, then we can determine the unicyclic graphs with perfect matchings of order 2n with the first to the ninth smallest matching energies for all n≥211.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42331445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信