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 245 for “"positive integer"”.
-
Unavoidable Minors of Large 5-Connected Graphs
This thesis shows that, for every positive integer $n \geq 5$, there exists a positive integer $N$ such that every $5-$connected graph with at least $N$ vertices has a minor isomorphic to one of thirty explicitly defined $5-$connected graphs $H_1(n), ..., H_{30}(n)$, each with at least $n$ vertices.
-
2-Color Rado Numbers for The Family of Equations x₁ + x₂ + ... xm-1 + c = (m - 1)xm
For every integer c and every positive integer m ≥ 3, let n = R(m, c) be the least integer, provided that it exists, such that for every coloring [special characters omitted]there exists integers x1, x2,...,xm (not necessarily distinct) such that [special characters omitted]and [special characters …
-
Natūraliojo skaičiaus reiškimas tiksliųjų kvadratų suma /
Representation of a Positive Integer by a Sum of Perfect Squares Waring’s problem is one of the classical problems in number theory. Throughout history it's variations interest mathematicians and to this day it continues to be one of the most famous question in classical mathematics. The aims of …
-
Fractions of Numerical Semigroups
… S and T be numerical semigroups and let k be a positive integer. We say that S is the quotient of T by k if an integer x belongs to S if and only if kx belongs to T. Given any integer k larger than 1 (resp., larger than 2), every numerical semigroup S is the quotient T/k of infinitely many …
-
Widely Digitally Delicate Brier Primes and Irreducibility Results for Some Classes of Polynomials
… Filaseta and J. Juillerat showed that for every positive integer k, there exist k consecutive widely digitally delicate primes. They also noted that for every positive integer k, there exist k consecutive primes which are Brier numbers. We show that for every positive integer k, there exist k …
-
Smooth Complete Intersections with Positive-Definite Intersection Form
… classify the smooth complete intersections with positive-definite intersection form on their middle cohomology. There are two families. The first family are quadric hypersurfaces in P(4k+1) with k a positive integer. The middle cohomology is always of rank two and the intersection lattice …
-
On a Constant Associated with the Prouhet-Tarry-Escott Problem
For n a positive integer, the Prouhet-Tarry-Escott Problem asks for two different sets of n positive integers for which the sum of the kth powers of the elements of one set is equal to the sum of the kth powers of the elements of the second set for each positive integer k < n. For n > 12, it is not …
-
On the Special Cases of Carmichael’s Totient Conjecture
… the arithmetic function defined as the number of positive integers less than or equal to n that are relatively prime to n. In his 1922 paper [3], Professor R. D. Carmichael conjectured that for each positive integer n, there exists at least one positive integer m̸ = n such that φ(m) = φ(n).In this …
-
Probabilistic graph colouring algorithms using Zykov trees
… number of G, denoted x (G), is the smallest positive integer k for which a proper k-colouring exists. The graph colouring decision problem is to determine whether for a graph G and a positive integer k, there exists a proper colouring of G using at most k colours. A Las Vegas algorithm, i.e. …
-
Unavoidable Structures in Large and Infinite Graphs
… induced subgraphs, Ramsey proved that for every positive integer r, every sufficiently large graph contains as an induced subgraph either Kr or Kr. It is well known that, for every positive integer r, every sufficiently large connected graph contains an induced subgraph isomorphic to one of Kr, …
-
Representations by Quaternary Quadratic Forms With Coefficients are 1,2,5 or 10
… formulas for the number of representations of a positive integer n by the quaternary quadratic forms a_1x_1^2+a_2x_2^2+a_3x_3^2+a_4x_4^2, where a_1,a_2,a_3,a_4 in {1,2,5,10}. We use a modular form approach.
-
Representation by Quaternary Quadratic Forms whose Coefficients are 1, 2, 7 and 14
… formulae for the number of representations of a positive integer n by the quaternary quadratic forms a_1x_1^2+a_2x_2^2+a_3x_3^2+a_4x_4^2, where a_1, a_2, a_3, a_4 in {1,2,7,14}. We use a modular form approach.
-
Tau-congruent numbers and integers in number fields
A positive integer n is the area of a Heron triangle if and only if there exists a non-zero rational number tau such that the elliptic curve E^n_tau: Y² = X(X-n tau)(X+n tau-¹) has a rational point of order different than two. Such an integer n is called a tau-congruent number. In the first part of …
-
Moments of distances between centres of Ford spheres
Given any positive integer k, we establish asymptotic formulas for the k-moments of the distances between the centres of ‘consecutive’ Ford spheres with radius less than 1/2S^2 for any positive integer S. This extends to higher dimensions the work on Ford circles by Chaubey, Malik and Zaharescu in …
-
Properties of the Pellian Sequence
… be introduced to show that there is a least positive integer x that makes Ax^2+1 a square if and only if A is a non-square. This method will be shown to produce the entire infinite solution set for any positive integer A. The method of continued fractions will be described and will be used to …
-
Lagranžo keturių kvadratų teorema /
Lagrange‘s four-square theorem states, that every positive integer can be expressed as the sum of four squares. The aim of this work is to present several proofs of this theorem, as well as show few of improvements for this theorem and ways to count the number of possible expressions in sums of …
-
Delta-System Methods in Contemporary Graph Theory
… probabilistic methods, to show that for every positive integer k, almost every graph has no k-minimum-difference-representation. This answers a question of Boros, Gurvich, and Meshulam.
-
Gallai-Ramsey Number of An 8-Cycle
Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an …
-
Efficient Algorithms for Graph-Theoretic and Geometric Problems
… to efficient computation of matrix products for positive integer matrices. We provide an efficient approximation algorithm for the partitioning problem and several algorithms for integer matrix multiplication. The multiplication algorithms are explicitly or implicitly based on an interpretation …
-
Coefficient Fields in Tensor Products
… p /= 0 such that Lpe <= K for some positive integer e. Let M be an inbetween field of K and L and f the canonical K-homo-morphism of the tensor product L ⊗ M over K onto the field composite LM = L. The purpose of this thesis is to study the existence of 1 ⊗ M-coefficient fields of L …
Page 1 of 13