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 13 of 13 for “"Integer matrices"”.

  1. Deterministic Unimodularity Certification and Applications for Integer Matrices

    … algorithms for many linear algebra problems on integer matrices, including solving a system of linear equations and computing the determinant, use high-order lifting. For a square nonsingular integer matrix A, high-order lifting computes B congruent to A^{-1} mod X^k and matrix R with AB = I + …

    waterloo Repository record for Deterministic Unimodularity Certification and Applications for Integer Matrices (opens in a new tab)

  2. Fast algorithms for computing with integer matrices: normal forms and applications

    … on fundamental computational problems in exact integer linear algebra. Specifically, for a nonsingular integer input matrix A of dimension n, we consider problems such as linear system solving and computing integer matrix normal forms. Our goal is to design algorithms that have complexity about …

    waterloo Repository record for Fast algorithms for computing with integer matrices: normal forms and applications (opens in a new tab)

  3. Arithmetic statistics of algebraic groups

    … part focuses on the arithmetic statistics of integer and rational matrices. More precisely, the topics considered in this part include the statistics of product sets of integer matrices, rational matrices satisfying specified properties and $2\times 2$ integer matrices with a given …

    unsw Repository record for Arithmetic statistics of algebraic groups (opens in a new tab)

  4. Efficient Algorithms for Graph-Theoretic and Geometric Problems

    … 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 of …

    lund Repository record for Efficient Algorithms for Graph-Theoretic and Geometric Problems (opens in a new tab) Download PDF for Efficient Algorithms for Graph-Theoretic and Geometric Problems (opens in a new tab)

  5. Structure and randomness in arithmetic settings

    … [f₁, f₂, …, f_d ], evaluated at d consecutive integers n+1, …, n+d, closely approximates points in R^d for a positive proportion of n; we obtain a further generalization which allows these functions to be composed with various arithmetic progressions. Secondly, we examine the eigenvalues of …

    ubc Repository record for Structure and randomness in arithmetic settings (opens in a new tab) Download PDF for Structure and randomness in arithmetic settings (opens in a new tab)

  6. Total Minor Polynomials of Oriented Hypergraphs

    Concepts of graph theory can be generalized to integer matrices through the use of oriented hypergraphs. An oriented hypergraph is an incidence structure consisting of vertices, edges, and incidences, equipped with three functions: a vertex incidence function, an edge incidence function, and an …

    texas-state Repository record for Total Minor Polynomials of Oriented Hypergraphs (opens in a new tab)

  7. Computing a Basis for an Integer Lattice

    The extended gcd problem takes as input two integers, and asks as output an integer linear combination of the integers that are equal to their gcd. The classical extended Euclidean algorithm and fast variants such as the half-gcd algorithm give efficient algorithmic solutions. In this thesis, we …

    waterloo Repository record for Computing a Basis for an Integer Lattice (opens in a new tab)

  8. Nelson Oppen combination as a rewrite theory

    … theories such as linear and non-linear real and integer arithmetic, arrays, uninterpreted and Boolean algebra. While solvers exist for many such theories or their subsets, it is common for interesting SMT problems to span multiple theories. SMT solvers typically use refinements of the …

    uiuc Repository record for Nelson Oppen combination as a rewrite theory (opens in a new tab)

  9. Bounded feedback and structural issues in linear multivariable systems

    … the paths of minimum or maximum weight of integer matrices. Algorithms are also proposed and assessed.

    city-london Download PDF for Bounded feedback and structural issues in linear multivariable systems (opens in a new tab)

  10. ONE-CUSPED CONGRUENCE SUBGROUPS OF SO(d, 1; Z)

    … is obtained using SO(n, 1; Z), a subset of the integer matrices with determinant 1. This is known to produce 1-cusped examples for small d. Taking special congruence conditions modulo a fixed number, we obtain congruence subgroups of SO(n, 1; Z) which also have cusps but possibly more than one. …

    temple Repository record for ONE-CUSPED CONGRUENCE SUBGROUPS OF SO(d, 1; Z) (opens in a new tab)

  11. Extremal and probabilistic problems for discrete structures

    … G with respect to P is the smallest non-negative integer t such that G ∗ Kt has property P, where G ∗ Kt is the graph obtained by adding t new vertices to G and all edges incident to such vertices. This notion was introduced by Nenadov, Sudakov and Wagner, who raised the question of determining …

    birmingham Download PDF for Extremal and probabilistic problems for discrete structures (opens in a new tab)

  12. On dilatations of surface automorphisms

    … $\lambda_f$ thus satisfy monic polynomials with integer coefficients. Fried \cite{Fried} showed that $\lambda_f$ is a unit in $\mathbb{Z}[\lambda_f]$ and that the Galois conjugates of $\lambda_f$ (excepts perhaps one of $\pm\lambda_f^{-1}$) lie in the open annulus …

    cornell Repository record for On dilatations of surface automorphisms (opens in a new tab)