Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 61 for “"Square-free"”.
-
A Generalization of Square-free Strings
… Specifically, we study a generalization of square-free strings, shuffle properties of strings, and formalizing the reasoning about finite strings. The existence of infinitely long square-free strings (strings with no adjacent repeating word blocks) over a three (or more) letter finite set …
-
Integral Representations of Cyclic Groups of Square-Free Order
Made available in DSpace on 2014-12-05T21:50:24Z (GMT). No. of bitstreams: 1 6303309.pdf: 1243208 bytes, checksum: 5554cf3da42f3a1b55de8cd7b0b87987 (MD5) Previous issue date: 1962
-
The Non-Existence of a Covering System with all Moduli Distinct, Large and Square-Free
… thesis, we present Hough’s proof for the case of square-free moduli.
-
Cohomology of Burnside Rings
… mark homomorphism corresponding to H. If |G| is square-free we give a complete description of these groups. If |G| is not square-free we show that for certain H, J ⊂ G the groups Ext^l_A(G)(Z_H , Z_J ) have unbounded rank. We also extend some of these results to the rational and complex rep- …
-
Covering Systems and the Minimum Modulus Problem
… on the minimum modulus in the case of distinct square-free moduli, and give a sharper bound of 118 for the minimum modulus of a finite covering with distinct square-free moduli.
-
New and existing results on circular words
… characterize exactly the lengths for which level square free circular words on three letters exist. This is accomplished through a modification of Shur’s construction of square-free circular words. A word on two letters is called a Frankel-Simpson word if the only squares it contains are 00, 11, …
-
On Some Conjectures in Additive Number Theory
… integer can be written as a sum of a prime and a square-free number with at most three prime divisors, which improves a theorem by Estermann that every sufficiently large integer can be written as a sum of a prime and a square-free number. In the second part of the thesis we prove some results …
-
Matching theory: subgraphs with degree constraints and other properties
… is introduced. The third problem is the square-free two-factor problem. A square-free two-factor is a two-factor in which the cycles don’t have length 4, i.e. are not squares. We obtain an augmenting path theorem like Berge’s augmenting path theorem for a 1-matching. Also we obtain a …
-
Explicit Estimates in the Theory of Prime Numbers
… two can be written as the sum of a prime and a square-free number. We then work similarly to prove that every integer greater than ten and not congruent to one modulo four can be written as the sum of the square of a prime and a square-free number. Finally, we provide new explicit results on an …
-
Structure-Preserving Matrix Methods for Computations on Univariate and Bivariate Bernstein Polynomials
… undertaken study into methods for computing the square-free factorisation of univariate and bivariate polynomials in Bernstein form. It will be shown how these two problems are intrinsically linked and how finding univariate polynomial roots and bivariate polynomial factors is equivalent to …
-
Algebraic and semi-algebraic invariants on quadrics
… on quadrics. The ranks of the minimal graded free resolution of square-free quadratic monomial ideals can be investigated combinatorially. We study the bounds on the algebraic invariant, Castelnuovo-Mumford regularity, of the quadratic ideals in terms of properties on the corresponding simple …
-
Some consequences of unique factorization in imaginary quadratic number fields of class number 1
For square-free m, the imaginary quadratic number fields Q/square root m of class number 1 occur when m = -1 , -2, -3, -7, -11, -19 -43, -67, -163. The unique factorization of algebraic integers in these number fields allows an elementary derivation of nine series involving ϖ and of nine algebraic …
-
Characterizations of edge ideals via LCM lattices
… are Cohen-Macaulay, and characterize the square-free monomial ideals that yield LCM lattices satisfying certain properties.
-
Trace Problems in Algebraic Number Fields and Applications to Characters of Finite Groups
… the conjecture for cyclotomic integers with square-free unitary conductor.
-
Homological Invariants of Monomial and Binomial Ideals
… we study numerical invariants of minimal graded free resolutions of homogeneous ideals in a polynomial ring R. Chapters 2, 3 and 4 deal with homological invariants of edge ideals of bipartite graphs. First, in Chapter 2, we relate regularity and depth of bipartite edge ideals to combinatorial …
-
Distribution of integers with prescribed arithmetic structure and applications
… conditions, lower bounds on the number of smooth square-free integers in arithmetic progression, an estimate on the smallest square-full number in almost all residue classes modulo a prime, a relaxation of Goldbach's conjecture from the point of view of Ramare's local model, and lastly a …
-
Ádám's Conjecture and Its Generalizations
… group of permutation polynomials on Z,, and n is square free.
-
Inferring Networks with Gene Knockouts and Computational Algebra
… an unknown Boolean function, we can create a square-free monomial or pseudomonomial ideal whose primary decomposition encodes the possible sets of variables that the function can depend on, and whether those interactions are activations or inhibitions. We apply this problem to time series data …
-
Construction of a Dimension Two Rank One Drinfeld Module
… the natural numbers. Let f(t) be an irreducible square-free polynomial with even degree in Fr[t] so that the leading coeffcient is not a square mod Fr. Let A = L = Fr[t][\sqrt{f(t)}]. We will examine the basic set-up required for a dimension two rank one Drinfeld module over L along with an …
-
Various problems on subproducts of residue classes modulo a prime
… residue classes modulo p can be written as a square-free product of positive integers up to y. Let us denote by y(p) the smallest such y. Booker and Pomerance show in their paper that except for p - 5 and 7, we have y(p) ≤ y and some better upper bounds were conjectured. Later, Munsch and …
Page 1 of 4