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 11 of 11 for “"Non-negative Integer"”.
-
Irreducibility Criteria For Polynomials With Non-Negative Integer Coefficients, and the Prime Factorization of F(N) For F(X) In Z[X]
… is irreducible. Let $f(x)$ be a polynomial with non-negative integer coefficients. We define $c(10)$ be the largest integer such that if $f(10)$ is prime and all the coefficients of $f(x)$ are $\le c(10)$, then $f(x)$ is irreducible. It is known that $$2.52~\times~10^{30}\le c(10)\le …
-
ΠΕΡΙΦΕΡΕΙΑΚΑ ΔΙΑΣΚΟΡΠΙΣΜΕΝΟΙ ΧΩΡΟΙ ΚΑΙ ΚΑΘΟΛΙΚΟΤΗΤΑ
… WITH EMPTY (D+K)-DERIVATIVE, WHERE K A NON-NEGATIVE INTEGER. IT IS ALSO PROVED THAT THERE IS NO UNIVERSAL ELEMENT IN THE FAMILY OF PL(RRIM-COM(D)) OF ALL SPACES WHICH HAVE A BASIS, WHOSE ELEMENTS HAVE COMPACT BOUNDARIES WITH EMPTY D-DERIVATIVE, WHERE D ANY ORDINAL NUMBER.
-
Theory and applications of freedom in matroids
To each cell e in a matroid M we can associate a non-negative integer ǁ e ǁ called the freedom of e. Geometrically the value ǁ e ǁ indicates how freely placed the cell is in the matroid. We see that ǁ e ǁ is equal to the degree of the modular cut generated by all the fully-dependent flats of M …
-
Robust Exact Algorithms for the Euclidean Bipartite Matching Problem
… n points in d-dimensional Euclidean space and an integer p ≥ 1, let the cost of an edge be the p-th power of the Euclidean distance between its endpoints. The objective of this problem is to find a minimum-cost matching in this complete bipartite graph. The Hungarian algorithm is a classical …
-
The Ordinary Weight conjecture and Dade's Projective Conjecture for p-blocks with an extra-special defect group
… of \(B\) for \(N_G(E, b_E)\). For a non-negative integer \(d\), let \(k_d(B)\) denote the number of irreducible characters \(\chi\) in \(B\) which have \(\chi(1)_p=p^{a-d}\) and let \(k_d(b)\) be the corresponding number of \(b\). Various generalizations of Alperin's Weight Conjecture …
-
A Separator-Based Framework for Graph Matching Problems
… matching in O(m\sqrt{n}) time. For graphs with non-negative integer edge costs at most C, it is known how to compute a minimum-cost maximum cardinality matching in roughly O(m\sqrt{n} log(nC)) time using combinatorial methods. While non-combinatorial methods exist, they are generally impractical …
-
On complex reflection groups G(m, 1, r) and their Hecke algebras
… of Ariki- Koike algebras. We use n x n arrays of non-negative integer sequences to characterize double cosets of quasi-parabolic subgroups. We define an analogue of permutation modules, for Ariki-Koike algebras, corresponding to certain subgroups indexed by multicompositions. These subgroups are …
-
Bounds on the genus of Riemann surfaces under certain group actions
… a finite group G with σ (G) = g for any given non-negative integer g. It is known that the values of the function σ cover well over 88% of all non-negative integers, and it has been conjectured that any remaining gaps in the range of the function σ can be filled using metabelian groups. In this …
-
A new approach to Kneser's theorem on asymptotic density
… the limit set, B*, is presented. For two sets of non-negative integers, A and B, with C∈A⋂B, the maximal sets, Aᴹ and Bᴹ, are the largest supersets of A and B, respectively, such that Aᴹ + Bᴹ = A + B. By shifting from A and B to Aᴹ and Bᴹ to initiate the analysis, the maximal properties of Aᴹ and …
-
On the decidability of problems in liveness of controlled Discrete Event Systems modeled by Petri Nets
… an event of the DES) can fire from a marking (a non-negative integer-valued vector that represents the state of the DES being modeled), then it can also fire from any larger marking. The monotonicity creates a possibility of representing an infinite-state system using what can be called a …