DOCSLIB.ORG

Trees of Irreducible Numerical Semigroups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Trees of Irreducible Numerical Semigroups Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 1 Article 5 Trees of Irreducible Numerical Semigroups Taryn M. Laird Northern Arizona University, [email protected] Jose E. Martinez Northern Arizona University Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj Recommended Citation Laird, Taryn M. and Martinez, Jose E. (2013) "Trees of Irreducible Numerical Semigroups," Rose-Hulman Undergraduate Mathematics Journal: Vol. 14 : Iss. 1 , Article 5. Available at: https://scholar.rose-hulman.edu/rhumj/vol14/iss1/5 Rose- Hulman Undergraduate Mathematics Journal Trees of Irreducible Numerical Semigroups Taryn M. Laird and Jos´eE. Martinez a Volume 14, No. 1, Spring 2013 Sponsored by Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN 47803 Email: [email protected] a http://www.rose-hulman.edu/mathjournal Northern Arizona University Rose-Hulman Undergraduate Mathematics Journal Volume 14, No. 1, Spring 2013 Trees of Irreducible Numerical Semigroups Taryn M. Laird and Jos´eE. Martinez Abstract.A 2011 paper by Blanco and Rosales describes an algorithm for construct- ing a directed tree graph of irreducible numerical semigroups of fixed Frobenius numbers. This paper will provide an overview of irreducible numerical semigroups and the directed tree graphs. We will also present new findings and conjectures concerning the structure of these trees. Acknowledgements: We would like to give a special thanks to our mentor, Jeff Rushall, for his help and guidance, and to Ian Douglas for sharing his expertise in programming. Page 58 RHIT Undergrad. Math. J., Vol. 14, No. 1 1 Introduction There are many problems in which we unknowingly encounter numerical semigroups in mathematics. Two of the most well known examples of these problems are the coin problem and the postage stamp problem. Here is one of many such puzzles. Example 1.1. Suppose we are given an infinite number of 4 cent, 6 cent, and 9 cent coins. We would like to determine the largest amount of exact change that we cannot make using combinations of these coins. In order to find this maximum number, we must consider all possible combinations of the coins. That is, fall possible amounts of changeg = f4k1 + 6k2 + 9k3jk1; k2; k3 2 Ng = f0; 4; 6; 8; 9; 10; 12; 13; 14; 15; 16; :::g Since we have made 4 consecutive integer amounts (12 cents, 13 cents, 14 cents and 15 cents) we know that all integer amounts greater than 15 cents can be made by adding more 4 cent coins to these consecutive amounts. This means that the largest amount of exact change we cannot make is 11 cents. The next problem is similar to Example 1.1, but it has an important difference. Example 1.2. Suppose we are given an infinite number of 4 cent and 14 cent coins and we again wish to find the largest amount of change that we cannot make with these coins. We again consider all possible combinations of the coins: fall possible amounts of changeg = f4k1 + 14k2jk1; k2 2 Ng = f0; 4; 8; 12; 14; 16; 18; :::g Note that we can never make an odd amount of change with our coins. This means that there cannot be a largest un-makeable amount. The infinitely large set of change amounts in the first example is called a numerical semi- group, and the largest uncreatable number is called the Frobenius number of the numerical semigroup. We now ask if there are other sets of coin denominations that have a largest un-makeable amount of 11 cents. It turns out that other such sets of denominations do share the same largest unmakeable amount and a special subset of the corresponding numerical semigroups can be recursively constructed in a directed tree graph. In the following sections of the paper we will first define numerical semigroups and certain properties that are important to both the numerical semigroups themselves and the directed tree graphs. We will then briefly examine how numerical semigroups are connected to com- munative ring theory. In section 4 we will present an algorithm that creates the directed tree graphs and construct a few examples. To conclude the paper, we will present some new results that help describe the structure of these directed tree graphs. RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 59 2 Numerical Semigroups We first need a solid grasp of what a numerical semigroup is, and more precisely, what it means to be an irreducible numerical semigroup. Definition 2.1. A numerical semigroup is a subset S of the nonnegative integers N that satisfies the following: 1. S contains 0. 2. S is closed under addition. 3. NnS is finite. We say fa1; a2; :::; ang is a generating set for S if S =fk1a1+k2a2+:::+knanjk1; k2; :::; kn 2 Ng, and we call each ai a generator of S. If no proper subset is a generating set for S, we say fa1; a2; :::; ang is the minimal generating set and we write S = ha1; a2; :::; ani; 0 < a1 < a2 < ::: < an. Example 2.1. Consider the numerical semigroup generated by 5, 6 and 13. Then S = h5; 6; 13i = f5k1 + 6k2 + 13k3jk1; k2; k3 2 Ng = f0; 5; 6; 10; 11; 12; 13; 15; 16; 17; 18; 19; 20; 21; 22; 23; :::g = f0; 5; 6; 10; 11; 12; 13; 15; !g The arrow indicates that all integers greater than 15 are in S. Associated with every numerical semigroup are two important integers which are impor- tant for our studies. Definition 2.2. The Frobenius number of a numerical semigroup S, denoted F (S), is the largest integer not in S. The multiplicity of S, denoted m(S), is the smallest positive element of S. Example 2.2. Consider once again the numerical semigroup generated by 5, 6, and 13. That is, S = h5; 6; 13i = f0; 5; 6; 10; 11; 12; 13; 15; !g Here F (S) = 14 as it is the largest integer not in S, and m(S) = 5, as 5 is the smallest positive element in S. Next we define the two special types of numerical semigroups that are the focus of our research. Page 60 RHIT Undergrad. Math. J., Vol. 14, No. 1 Definition 2.3. A numerical semigroup S is said to be symmetric if and only if F (S) is odd and if x 2 Z 2= S, then F (S) − x 2 S: Example 2.3. Consider, S = h6; 7; 10; 11i = f0; 6; 7; 10; 11; 12; 13; 14; 16; !g. Here F (S) = 15, which is odd, as required. In addition, for every integer x2 = S we have F (S) − x 2 S as depicted in Figure 1 below. For example, if x = 8, we have 15 − 8 = 7 2 S, and the same can be verified for all elements in Z 2= S. Thus S is symmetric. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Figure 1 Definition 2.4. A numerical semigroup S is said to be pseudosymmetric if and only if F (S) F (S) is even and if x 2 Z 2= S, then either x = 2 or F (S) − x 2 S. Example 2.4. Again consider S = h5; 6; 13i = f0; 5; 6; 10; 11; 12; 13; 15; !g. As previously discussed, F (S) = 14 is even as required. As indicated in Figure 2, for every integer x2 = S F (S) we have either x = 2 or F (S) − x 2 S, and so S is pseudosymmetric. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Figure 2 The reason for our emphasis on symmetric and pseudosymmetric numerical semigroups will be made clear in the remaining sections of the paper. RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 61 2.1 Irreducible Numerical Semigroups Definition 2.5. A numerical semigroup S is irreducible if it cannot be expressed as an intersection of two numerical semigroups that properly contain S. For a given Frobenius number F , the set of all irreducible numerical semigroups with Frobenius number F is denoted I(F ). In [2], Branco and Rosales showed that a numerical semigroup is irreducible if and only if it is symmetric or pseudosymmetric. The following theorem [1] defines a certain numerical semigroup unique to every Frobenius number. Theorem 2.1. For every positive integer F , there exists a unique irreducible numerical F semigroup C(F ) whose generators are all larger than 2 . Moreover, ( F +1 f0; 2 ; !gnfF g if F is odd, C(F ) = F f0; 2 + 1; !gnfF g if F is even. ( F +1 F +3 h 2 ; 2 ; :::; F − 1i if F is odd, = F F h 2 + 1; 2 + 2; :::; F − 1;F + 1i if F is even. Example 2.5. Using Theorem 2.1 we will now construct C(15). 15 + 1 C(15) = f0; ; !gnf15g 2 = f0; 8; 9; 10; 11; 12; 13; 14; 15; 16; !gnf15g = f0; 8; 9; 10; 11; 12; 13; 14; 16; !g = h8; 9; 10; 11; 12; 13; 14i Note that when F is odd, C(F ) is generated by an interval of consecutive integers of N. This type of numerical semigroup, first investigated by Garc´ıa-S´anchez and Rosales in [3], led to a new characterization of symmetry for interval-generated numerical semigroups. The interested reader can consult [3] for more information. 3 Graph Theory Necessities The remainder of this paper will focus on graphs of families of specific numerical semi- groups that share a common Frobenius number. Therefore, a brief review of basic graph theory terminology is appropriate.
Load more

Recommended publications
  • Fractions of Numerical Semigroups
    University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 5-2010 Fractions of Numerical Semigroups Harold Justin Smith University of Tennessee - Knoxville, [email protected] Follow this and additional works at: https://trace.tennessee.edu/utk_graddiss Part of the Algebra Commons, and the Number Theory Commons Recommended Citation Smith, Harold Justin, "Fractions of Numerical Semigroups. " PhD diss., University of Tennessee, 2010. https://trace.tennessee.edu/utk_graddiss/750 This Dissertation is brought to you for free and open access by the Graduate School at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. To the Graduate Council: I am submitting herewith a dissertation written by Harold Justin Smith entitled "Fractions of Numerical Semigroups." I have examined the final electronic copy of this dissertation for form and content and recommend that it be accepted in partial fulfillment of the equirr ements for the degree of Doctor of Philosophy, with a major in Mathematics. David E. Dobbs, Major Professor We have read this dissertation and recommend its acceptance: David F. Anderson, Pavlos Tzermias, Michael W. Berry Accepted for the Council: Carolyn R. Hodges Vice Provost and Dean of the Graduate School (Original signatures are on file with official studentecor r ds.) To the Graduate Council: I am submitting herewith a dissertation written by Harold Justin Smith entitled \Fractions of Numerical Semigroups." I have examined the final electronic copy of this dissertation for form and content and recommend that it be accepted in partial fulfillment of the require- ments for the degree of Doctor of Philosophy, with a major in Mathematics.
    [Show full text]
  • Tempered Monoids of Real Numbers, the Golden Fractal Monoid, and the Well-Tempered Harmonic Semigroup
    Tempered Monoids of Real Numbers, the Golden Fractal Monoid, and the Well-Tempered Harmonic Semigroup Published in Semigroup Forum, Springer, vol. 99, n. 2, pp. 496-516, November 2019. ISSN: 0037-1912. Maria Bras-Amoros´ November 5, 2019 Abstract This paper deals with the algebraic structure of the sequence of harmonics when combined with equal temperaments. Fractals and the golden ratio appear surprisingly on the way. + The sequence of physical harmonics is an increasingly enumerable submonoid of (R ; +) whose pairs of consecutive terms get arbitrarily close as they grow. These properties suggest the definition of a new mathematical object which we denote a tempered monoid. Mapping the elements of the tempered monoid of physical harmonics from R to N may be considered tantamount to defining equal temperaments. The number of equal parts of the octave in an equal temperament corresponds to the multiplicity of the related numerical semigroup. Analyzing the sequence of musical harmonics we derive two important properties that tempered monoids may have: that of being product-compatible and that of being fractal. We demonstrate that, up to normal- ization, there is only one product-compatible tempered monoid, which is the logarithmic monoid, and there is only one nonbisectional fractal monoid which is generated by the golden ratio. The example of half-closed cylindrical pipes imposes a third property to the sequence of musical har- monics, the so-called odd-filterability property. We prove that the maximum number of equal divisions of the octave such that the discretizations of the golden fractal monoid and the logarithmic monoid coincide, and such that the discretization is odd- filterable is 12.
    [Show full text]
  • Program of the Sessions San Diego, California, January 9–12, 2013
    Program of the Sessions San Diego, California, January 9–12, 2013 AMS Short Course on Random Matrices, Part Monday, January 7 I MAA Short Course on Conceptual Climate Models, Part I 9:00 AM –3:45PM Room 4, Upper Level, San Diego Convention Center 8:30 AM –5:30PM Room 5B, Upper Level, San Diego Convention Center Organizer: Van Vu,YaleUniversity Organizers: Esther Widiasih,University of Arizona 8:00AM Registration outside Room 5A, SDCC Mary Lou Zeeman,Bowdoin upper level. College 9:00AM Random Matrices: The Universality James Walsh, Oberlin (5) phenomenon for Wigner ensemble. College Preliminary report. 7:30AM Registration outside Room 5A, SDCC Terence Tao, University of California Los upper level. Angles 8:30AM Zero-dimensional energy balance models. 10:45AM Universality of random matrices and (1) Hans Kaper, Georgetown University (6) Dyson Brownian Motion. Preliminary 10:30AM Hands-on Session: Dynamics of energy report. (2) balance models, I. Laszlo Erdos, LMU, Munich Anna Barry*, Institute for Math and Its Applications, and Samantha 2:30PM Free probability and Random matrices. Oestreicher*, University of Minnesota (7) Preliminary report. Alice Guionnet, Massachusetts Institute 2:00PM One-dimensional energy balance models. of Technology (3) Hans Kaper, Georgetown University 4:00PM Hands-on Session: Dynamics of energy NSF-EHR Grant Proposal Writing Workshop (4) balance models, II. Anna Barry*, Institute for Math and Its Applications, and Samantha 3:00 PM –6:00PM Marina Ballroom Oestreicher*, University of Minnesota F, 3rd Floor, Marriott The time limit for each AMS contributed paper in the sessions meeting will be found in Volume 34, Issue 1 of Abstracts is ten minutes.
    [Show full text]
  • Ω-Primality in Arithmetic Leamer Monoids
    !-PRIMALITY IN ARITHMETIC LEAMER MONOIDS SCOTT T. CHAPMAN AND ZACK TRIPP s Abstract. Let Γ be a numerical semigroup. The Leamer monoid SΓ, for s 2 NnΓ, is the monoid consisting of arithmetic sequences of step size s contained s in Γ. In this note, we give a formula for the !-primality of elements in SΓ when Γ is an numerical semigroup generated by a arithmetic sequence of positive integers. 1. Preliminaries A numerical monoid S is an additive submonoid of the nonnegative integers N0 under regular addition such that jN0 − Sj < 1 ([11] is a good general reference on this subject). A great deal of literature has appeared over the past 15 years which studies the nonunique factorization properties of these monoids (for instance, see [4], [6], and [5] and the references therein). Among the factorization constants studied on these objects is the !-primality function, which in some sense measures how far an element x 2 S is from being a prime element. A general survey of these results can be found in [16], while the papers [2], [3], and [9] all consider issues related to algorithms for computing speciic values of the !-function. Other papers that touch on this subject in more specific terms are [7], [8], [14], and [17]. In this paper, we pick up on the study begun in [12] of the factorization properties of Leamer monoids, which are constructed using numerical monoids. Leamer monoids first appeared in [10] and were used in that paper to study the Huenke-Wiegand conjecture from commutative algebra. In our current work, we address Problem 5.4 of [12] and completely determine the behavior of the ! function on a Leamer monoid generated by an arithmetic numerical monoid (i.e, a numerical monoid generated by an arithmetic sequence of integers).
    [Show full text]
  • An Adiabatic Quantum Algorithm for the Frobenius Problem
    An adiabatic quantum algorithm for the Frobenius problem J. Ossorio-Castillo∗1,2 and José M. Tornero y2 1Instituto Tecnolóxico de Matemática Industrial (ITMATI), 15782 Santiago de Compostela, Spain 2IMUS & Departamento de Álgebra, Universidad de Sevilla, 41012 Sevilla, Spain Abstract The (Diophantine) Frobenius problem is a well-known NP-hard problem (also called the stamp problem or the chicken nugget problem) whose origins lie in the realm of combinatorial number theory. In this paper we present an adiabatic quantum algorithm which solves it, using the so- called Apéry set of a numerical semigroup, via a translation into a QUBO problem. The algorithm has been specifically designed to run in a D-Wave 2X machine. 1 Numerical semigroups and the Frobenius problem The study of numerical semigroups has its origins at the end of the 19th Century, when English mathematician James Joseph Sylvester (1814 – 1897) and German mathematician Ferdinand Georg Frobenius (1849 – 1917) were both interested in what is now known as the Frobenius problem, which we proceed to enunciate. Definition 1.1. Let a1; a2; : : : ; an 2 Z≥0 with gcd(a1; a2; : : : ; an) = 1, the Frobenius problem, or FP, is the problem of finding the largest positive integer that cannot be expressed as an integer conical combination of these numbers, i.e., as a sum n X λiai with λi 2 Z≥0: j=1 This problem, so easy to state, can be extremely complicated to solve in the majority of cases, as will be seen later. It can be found in a wide variety of contexts, being the most famous the problem of finding the largest amount of money which cannot be obtained with a certain set of coins: if, for example, we have an unlimited amount of coins of 2 and 5 units, we can represent any quantity except 1 and 3.
    [Show full text]
  • Factoring in the Chicken Mcnugget Monoid
    Mathematics Magazine ISSN: 0025-570X (Print) 1930-0980 (Online) Journal homepage: http://maa.tandfonline.com/loi/umma20 Factoring in the Chicken McNugget Monoid Scott T. Chapman & Chris O’Neill To cite this article: Scott T. Chapman & Chris O’Neill (2018) Factoring in the Chicken McNugget Monoid, Mathematics Magazine, 91:5, 323-336, DOI: 10.1080/0025570X.2018.1515559 To link to this article: https://doi.org/10.1080/0025570X.2018.1515559 Published online: 07 Dec 2018. Submit your article to this journal Article views: 128 View Crossmark data Full Terms & Conditions of access and use can be found at http://maa.tandfonline.com/action/journalInformation?journalCode=umma20 ARTICLES Factoring in the Chicken McNugget Monoid SCOTT T. CHAPMAN Sam Houston State University Huntsville, TX 77341-2206 [email protected] CHRIS O’NEILL University of California Davis Davis, CA 95616 [email protected] People just want more of it.—Ray Kroc [9] Every day, 34 million Chicken McNuggets are sold worldwide [4]. At most McDonalds locations in the United States today, Chicken McNuggets are sold in packs of 4, 6, 10, 20, 40, and 50 pieces. However, shortly after their introduction in 1979, they were sold in packs of 6, 9, and 20. The following problem spawned from the use of these latter three numbers. The Chicken McNugget Problem. What numbers of Chicken McNuggets can be ordered using only packs with 6, 9, or 20 pieces? Early references to this problem can be found in [28] and [32]. Positive integers satisfying the Chicken McNugget Problem are now known as McNugget numbers [23].
    [Show full text]
  • Numerical Semigroups Problem List
    NUMERICAL SEMIGROUPS PROBLEM LIST M. DELGADO, P. A. GARC´IA-SANCHEZ,´ AND J. C. ROSALES 1. Notable elements and first problems linear combination, with nonnegative integer co- efficients, of a fixed set of integers with greatest A numerical semigroup is a subset of N (here common divisor equal to 1. He also raised the N denotes the set of nonnegative integers) that is question of determining how many positive inte- closed under addition, contains the zero element, gers do not admit such a representation. With and its complement in N is finite. our terminology, the first problem is equivalent If A is a nonempty subset of N, we denote by to that of finding a formula in terms of the gen- hAi the submonoid of N generated by A, that is, erators of a numerical semigroup S of the great- est integer not belonging to S (recall that its hAi = {λ1a1+···+λnan | n ∈ N,λi ∈ N, ai ∈ A}. complement in N is finite). This number is thus It is well known (see for instance [41, 45]) that known in the literature as the Frobenius num- hAi is a numerical semigroup if and only if ber of S, and we will denote it by F(S). The gcd(A) = 1. elements of H(S) = N \ S are called gaps of If S is a numerical semigroup and S = hAi for S. Therefore the second problem consists in some A ⊆ S, then we say that A is a system of determining the cardinality of H(S), sometimes generators of S, or that A generates S.
    [Show full text]
  • On the Enumeration of the Set of Numerical Semigroups with Fixed Frobenius Number
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Computers and Mathematics with Applications 63 (2012) 1204–1211 Contents lists available at SciVerse ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa On the enumeration of the set of numerical semigroups with fixed Frobenius number V. Blanco a,∗, J.C. Rosales b a Department of Quantitative Methods for Economics & Business, Universidad de Granada, E-18011 Granada, Spain b Department of Algebra, Universidad de Granada, E-18071 Granada, Spain article info a b s t r a c t Article history: In this paper, we present an efficient algorithm to compute the whole set of numerical Received 19 August 2011 semigroups with a given Frobenius number F. The methodology is based on the Received in revised form 12 December 2011 construction of a partition of that set by a congruence relation. It is proven that each Accepted 12 December 2011 class in the partition contains exactly one irreducible and one homogeneous numerical semigroup, and from those two elements the whole class can be reconstructed. An Keywords: alternative encoding of a numerical semigroup, its Kunz-coordinates vector, is used to Numerical semigroup propose a simple methodology to enumerate the desired set by manipulating a lattice Genus Frobenius number polytope of 0–1 vectors and solving certain integer programming problems over it. Partitions of sets ' 2011 Elsevier Ltd. All rights reserved. Kunz-coordinates vectors Algorithms 1. Introduction Let N be the set of nonnegative integer numbers. A numerical semigroup is a subset S of N closed under addition, containing zero and such that N n S is finite.
    [Show full text]
  • The Frobenius Problem in a Free Monoid
    The Frobenius Problem in a Free Monoid by Zhi Xu A thesis presented to the University of Waterloo in ful¯llment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science Waterloo, Ontario, Canada, 2009 °c Zhi Xu 2009 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required ¯nal revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Given positive integers c1; c2; : : : ; ck with gcd(c1; c2; : : : ; ck) = 1, the Frobenius prob- lem (FP) is to compute the largest integer g(c1; c2; : : : ; ck) that cannot be written as a non-negative integer linear combination of c1; c2; : : : ; ck. The Frobenius prob- lem in a free monoid (FPFM) is a non-commutative generalization of the Frobe- nius problem. Given words x1; x2; : : : ; xk such that there are only ¯nitely many words that cannot be written as concatenations of words in f x1; x2; : : : ; xk g, the FPFM is to ¯nd the longest such words. Unlike the FP, where the upper bound 2 g(c1; c2; : : : ; ck) · max1·i·k ci is quadratic, the upper bound on the length of the longest words in the FPFM can be exponential in certain measures and some of the exponential upper bounds are tight. For the 2FPFM, where the given words over § are of only two distinct lengths m and n with 1 < m < n, the length of the longest omitted words is · g(m; m j§jn¡m + n ¡ m).
    [Show full text]
  • NUMERICAL SEMIGROUPS and APPLICATIONS Abdallah Assi, Pedro A
    NUMERICAL SEMIGROUPS AND APPLICATIONS Abdallah Assi, Pedro A. García-Sánchez To cite this version: Abdallah Assi, Pedro A. García-Sánchez. NUMERICAL SEMIGROUPS AND APPLICATIONS. 2014. hal-01085760 HAL Id: hal-01085760 https://hal.archives-ouvertes.fr/hal-01085760 Preprint submitted on 21 Nov 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. NUMERICAL SEMIGROUPS AND APPLICATIONS ABDALLAH ASSI AND PEDRO A. GARC´IA-SANCHEZ´ Contents Introduction 1 1. Notable elements 2 1.1. Numerical semigroups with maximal embedding dimension. 9 1.2. Special gaps and unitary extensions of a numerical semigroup 10 2. Irreducible numerical semigroups 11 2.1. Decomposition of a numerical semigroup into irreducible semigroups 15 2.2. Free numerical semigroups 15 3. Semigroup of an irreducible meromorphic curve 17 3.1. Newton-Puiseux theorem 17 3.2. The local case 27 3.3. The case of curves with one place at infinity 28 4. Minimal presentations 32 5. Factorizations 38 5.1. Length based invariants 38 5.2. Distance based invariants 41 5.3. How far is an irreducible from being prime 43 References 45 Introduction Numerical semigroups arise in a natural way in the study of nonnegative integer solutions to Diophantine equations of the form a1x1 + ··· + anxn = b, where a1,...,an, b ∈ N (here N denotes the set of nonnegative integers; we can reduce to the case gcd(a1,...,an) = 1).
    [Show full text]
  • Numerical Semigroups Mini-Course
    NUMERICAL SEMIGROUPS MINI-COURSE P.A. GARCÍA-SÁNCHEZ CONTENTS Lecture 1. Three ways for representing a numerical semigroup. Generalities 2 1. Generators (first choice) 2 2. Multiplicity, Frobenius number, Gaps, (Cohen-Macaulay) type 2 3. Apéry sets, the TOOL 3 4. Fundamental gaps (second choice) 3 5. The set of oversemigroups of a numerical semigroup 4 6. Presentations (third choice) 5 7. Some (numerical) semigroup rings 6 Lecture 2. Big families 7 8. Symmetric and pseudo-symmetric numerical semigroups 7 9. Irreducible numerical semigroups. Decompositions into irreducibles 8 10. Complete intersections and telescopic numerical semigroups 8 11. Maximal embedding dimension numerical semigroups. Arf property 9 12. Families closed under intersection and adjoin of the Frobenius number 10 Lecture 3. Numerical semigroups and Diophantine inequalities 10 13. The set of all numerical semigroups with fixed multiplicity is a monoid 10 14. Modular Diophantine numerical semigroups 11 15. Proportionally modular Diophantine numerical semigroups, or finding the non-negative integer solutions to ax modb cx 12 ≤ 16. Toms’ result on the positive cone of the K0-group for some C ∗-algebras 14 17. References 14 I would like to thank CMUP and Departamento de Matemática Pura for their kind hospitality. Special thanks to Manuel Delgado with whom I enjoyed both working, running and programming in numerical semigroups. 1 2 P.A. GARCÍA-SÁNCHEZ Lecture 1. Three ways for representing a numerical semigroup. Generalities A numerical semigroup is a subset of the set of nonnegative integers (de- noted here by N) closed under addition, containing the zero element and with finite complement in N.
    [Show full text]
  • Download The
    Visit : https://hemanthrajhemu.github.io Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM Contact: MAIL: [email protected] INSTAGRAM: www.instagram.com/hemanthraj_hemu/ INSTAGRAM: www.instagram.com/futurevisionbie/ WHATSAPP SHARE: https://bit.ly/FVBIESHARE Introduction to The Design & ~ ~ Analysis of Algorithms IND EDITION " ~ Anany Levitin Villanova University Boston San Francisco New York London Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Paris Cape Town Hong Kong Montreal https://hemanthrajhemu.github.io Contents ix 2.6 Empirical Analysis of Algorithms 84 Exercises 2.6 90 2.7 Algorithm Visualization 91 Summary 95 3 Brute Force 97 3.1 Selection Sort and Bubble Sort 98 Selection Sort 98 Bubble Sort 100 Exercises 3.1 102 3.2 Sequential Search and Brute-Force String Matching 103 Sequential Search 103 Brute-Force String Matching 104 Exercises 3.2 105 3.3 Closest-Pair and Convex-Hull Problems by Brute Force 107 Closest-Pair Problem 107 Convex-Hull Problem 108 Exercises 3.3 112 3.4 Exhaustive Search 114 Traveling Salesman Problem 114 Knapsack Problem 115 Assignment Problem 116 Exercises 3.4 119 Summary 120 4 Divide-and-Conquer 123 4.1 Mergesort 125 Exercises 4.1 128 4.2 Quicksort 129 Exercises 4.2 134 4.3 Binary Search 135 Exercises 4.3 138 https://hemanthrajhemu.github.io r 111 )( Contents I ' i::! 4.4 Binary Tree Traversals and Related Properties 139 Exercises 4.4 142 I:],, 4.5 Multiplication of Large Integers and Strassen's Matrix Multiplication 144 Multiplication of Large Integers 144 Strassen's Matrix
    [Show full text]