580,704 research outputs found

    Avoiding abelian squares in partial words

    Get PDF
    AbstractErdős raised the question whether there exist infinite abelian square-free words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words, or sequences that may contain some holes. In particular, we give lower and upper bounds for the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. Several of our constructions are based on iterating morphisms. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five. We also investigate the number of partial words of length n with a fixed number of holes over a five-letter alphabet that avoid abelian squares and show that this number grows exponentially with n

    Rich Words and Balanced Words

    Get PDF
    This thesis is mostly focused on palindromes. Palindromes have been studied extensively, in recent years, in the field of combinatorics on words.Our main focus is on rich words, also known as full words. These are words which have maximum number of distinct palindromes as factors.We shed some more light on these words and investigate certain restricted problems. Finite rich words are known to be extendable to infinite rich words. We study more closely how many different ways, and in which situations, rich words can be extended so that they remain rich.The defect of a ord is defined to be the number of palindromes the word is lacking.We will generalize the definition of defect with respect to extending the word to be infinite.The number of rich words, on an alphabet of size nn, is given an upper and a lower bound. Hof, Knill and Simon presented (Commun. Math. Phys. 174, 1995) a well-known question whether all palindromic subshifts which are enerated by primitive substitutions arise from substitutions which are in class P. Over the years, this question has transformed a bit and is nowadays called the class P conjecture. The main point of the conjecture is to attempt to explain how an infinite word can contain infinitely many palindromes.We will prove a partial result of the conjecture. Rich square-free words are known to be finite (Pelantov\'a and Sarosta, Discrete Math. 313, 2013). We will give another proof for that result. Since they are finite, there exists a longest such word on an nn-ary alphabet.We give an upper and a lower bound for the length of that word. We study also balanced words. Oliver Jenkinson proved (Discrete Math., Alg. and Appl. 1(4), 2009) that if we take the partial sum of the lexicographically ordered orbit of a binary word, then the balanced word gives the least partial sum. The balanced word also gives the largest product. We will show that, at the other extreme, there are the words of the form 0qp1p0^{q-p}1^p (pp and qq are integers with 1p<q1\leq p<q), which we call the most unbalanced words. They give the greatest partial sum and the smallest product.Tässä väitöskirjassa käsitellään pääasiassa palindromeja. Palindromeja on tutkittu viime vuosina runsaasti sanojen kombinatoriikassa.Suurin kiinnostuksen kohde tässä tutkielmassa on rikkaissa sanoissa. Nämä ovat sanoja joissa on maksimaalinen määrä erilaisia palindromeja tekijöinä.Näitä sanoja tutkitaan monesta eri näkökulmasta. Äärellisiä rikkaita sanoja voidaan tunnetusti jatkaa äärettömiksi rikkaiksi sanoiksi.Työssä tutkitaan tarkemmin sitä, miten monella tavalla ja missä eri tilanteissa rikkaita sanoja voidaan jatkaa siten, että ne pysyvät rikkaina.Sanan vajauksella tarkoitetaan puuttuvien palindromien lukumäärää.Vajauksen käsite yleistetään tapaukseen, jossa sanaa on jatkettava äärettömäksi sanaksi.Rikkaiden sanojen lukumäärälle annetaan myös ylä- ja alaraja. Hof, Knill ja Simon esittivät kysymyksen (Commun. Math. Phys. 174, 1995), saadaanko kaikki äärettömät sanat joissa on ääretön määrä palindromeja tekijöinä ja jotka ovat primitiivisen morfismin generoimia, morfismeista jotka kuuluvat luokkaan P. Nykyään tätä ongelmaa kutsutaan luokan P konjektuuriksi ja sen tarkoitus on saada selitys sille,millä tavalla äärettömässä sanassa voi olla tekijöinä äärettömän monta palindromia. Osittainen tulos tästä konjektuurista todistetaan. Rikkaiden neliövapaiden sanojen tiedetään olevan äärellisiä (Pelantov\'a ja Starosta, Discrete Math. 313, 2013). Tälle tulokselle annetaan uudenlainen todistus.Koska kyseiset sanat ovat äärellisiä, voidaan selvittää mikä niistä on pisin.Ylä- ja alaraja annetaan tällaisen pisimmän sanan pituudelle. Työssä tutkitaan myös tasapainotettuja sanoja.Tasapainotetut sanat antavat pienimmän osittaissumman binäärisille sanoille (Jenkinson, Discrete Math., Alg. and Appl. 1(4), 2009).Lisäksi ne antavat suurimman tulon.Muotoa 0qp1p0^{q-p}1^p (pp ja qq ovat kokonaislukuja joille 1p<q1\leq p<q) olevien sanojen todistetaan vastaavasti antavan suurimman osittaissumman ja pienimmän tulon.Ne muodostavat täten toisen ääripään tasapainotetuille sanoille, ja asettavat kaikki muut sanat näiden väliin.Siirretty Doriast

    Words with the Maximum Number of Abelian Squares

    Full text link
    An abelian square is the concatenation of two words that are anagrams of one another. A word of length nn can contain Θ(n2)\Theta(n^2) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length nn grows quadratically with nn.Comment: To appear in the proceedings of WORDS 201

    Rapid Analysis of Adulterated Dexamethasone in Joint-Pain Killer Traditional Herbal Medicine (THM) Using Infrared Spectroscopy

    Full text link
    A rapid, non-destructive and reagent-free infrared spectroscopy combined with Partial Least Square (PLS) has been developed for the dexamethasone quantification in joint-pain killer traditional herbal medicine (THM). The main aim of this study is to select the best wavenumbers that are capable of providing the high coefficient of determination (R2), low values of Root Mean Square Error of Calibration (RMSEC), Root Mean Square Error of Cross Validation (RMSECV) and predictive residual error sum of squares (PRESS). Finally, wavenumbers 3646, 3642, 2461, 2453, 2432, 2406, 2229, 2209, 2197, 2097, 2092, 2064, 2059, 2047, 2026, 2009, 1969, and 1513 cm-1 were selected for the prediction of dexamethasone in the joint-pain killer traditional herbal medicine. The correlation between the actual values of dexamethasone determined in joint-pain killer traditional herbal medicine using infrared spectroscopy combined with PLS revealed the R2 values of 0.9988. The RMSEC values obtained 0,009455. The PRESS and RMSECV value obtained as the results of cross-validation model selection for dexamethasone in joint-pain killer traditional herbal medicine were 0,0022721.00 and 0,02902, respectively. The high value of R2 and low value of RMSEC, RMSECV and PRESS indicated that this method had high accuracy and precision in a validated condition for the dexamethasone quantification in the joint-pain killer traditional herbal medicine. These results indicated that infrared spectroscopy combined with PLS can be an alternative method for the dexamethasone determination in joint-pain killer traditional herbal medicine.his part contains English version of the abstract. The abstract presents background, method of the research/ literary study and discussion. The abstract consist of maximum 300 words. All sentence must represent the core of research presented in good structure of sentences

    Abelian-Square-Rich Words

    Full text link
    An abelian square is the concatenation of two words that are anagrams of one another. A word of length nn can contain at most Θ(n2)\Theta(n^2) distinct factors, and there exist words of length nn containing Θ(n2)\Theta(n^2) distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length nn grows quadratically with nn. More precisely, we say that an infinite word ww is {\it abelian-square-rich} if, for every nn, every factor of ww of length nn contains, on average, a number of distinct abelian-square factors that is quadratic in nn; and {\it uniformly abelian-square-rich} if every factor of ww contains a number of distinct abelian-square factors that is proportional to the square of its length. Of course, if a word is uniformly abelian-square-rich, then it is abelian-square-rich, but we show that the converse is not true in general. We prove that the Thue-Morse word is uniformly abelian-square-rich and that the function counting the number of distinct abelian-square factors of length 2n2n of the Thue-Morse word is 22-regular. As for Sturmian words, we prove that a Sturmian word sαs_{\alpha} of angle α\alpha is uniformly abelian-square-rich if and only if the irrational α\alpha has bounded partial quotients, that is, if and only if sαs_{\alpha} has bounded exponent.Comment: To appear in Theoretical Computer Science. Corrected a flaw in the proof of Proposition

    Generalized cover ideals and the persistence property

    Full text link
    Let II be a square-free monomial ideal in R=k[x1,,xn]R = k[x_1,\ldots,x_n], and consider the sets of associated primes Ass(Is){\rm Ass}(I^s) for all integers s1s \geq 1. Although it is known that the sets of associated primes of powers of II eventually stabilize, there are few results about the power at which this stabilization occurs (known as the index of stability). We introduce a family of square-free monomial ideals that can be associated to a finite simple graph GG that generalizes the cover ideal construction. When GG is a tree, we explicitly determine Ass(Is){\rm Ass}(I^s) for all s1s \geq 1. As consequences, not only can we compute the index of stability, we can also show that this family of ideals has the persistence property.Comment: 15 pages; revised version has a new introduction; references updated; to appear in J. Pure. Appl. Algebr
    corecore