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 31 for “"Rank-1"”.
-
Co-rank 1 Arithmetic Siegel--Weil
We prove the arithmetic Siegel–Weil formula in co-rank 1, for Kudla–Rapoport special cycles on exotic smooth integral models of unitary Shimura varieties of arbitrarily large even arithmetic dimension. We also propose a construction for arithmetic special cycle classes associated to possibly …
-
Irrational behavior of algebraic discrete valuations
… We construct a family of algebraic discrete rank 1 valuations whose associated Hilbert function cannot be written as the sum of a quasi-polynomial and a bounded function. We further show that the set of multiplicities associated to these algebraic discrete rank 1 valuations contains the …
-
Infrastructure, Arithmetic, and Class Number Computations in Purely Cubic Function Fields of Characteristic at Least 5
… number, h, of K, and in the case that O has unit rank 1 or 2, the regulator and ideal class number of O as well. A method of Scheidler and Stein [SS07, SS08] determines sharper upper and lower bounds on h, for a given cubic function field, than those given by the Hasse-Weil Theorem. We then employ …
-
Centralizers in automorphism groups
… the fourth chapter, we introduce the notion of a rank-1 homeomorphism of a zero-dimensional Polish space X, analogous in many ways to a rank-1 invertible measure-preserving transformation. We show that every rank-1 homeomorphism with a non-repeating tower representation (the class of such …
-
Central extensions of divisible groups
… the quotient is homocyclic. When the kernel has rank 1, we parametrize isomorphism classes of d-ab extensions with homocyclic quotient by constructing a family of group presentations. We also give a general reduction of d-ab extensions to the case when the kernel and center of the extensions …
-
Representations of Cherednik algebras in positive characteristic
… of the rational Cherednik algebras of rank 1 in characteristic p > 0. There are two cases. One is the "quantum" case, where "Planck's constant" is nonzero and generic irreducible representations have dimension pr, where r is the order of the cyclic group contained in the algebra. The …
-
Bounding cohomology for low rank algebraic groups
… We then concentrate on algebraic groups in rank 1 and 2, and prove some new results in their bounding cohomology.
-
New results in canonical polyadic decomposition overfinite fields
… (multidimensional array) as a sum of several rank-1 tensors, each of which is an outer/separable product of vectors. The number of rank-1 tensors used in a CPD is called the rank of the CPD, and the minimum possible rank of a CPD for a given tensor is called the rank of the tensor. CPD is at …
-
Challenges in recommender systems : scalability, privacy, and structured recommendations
… a sparse dual and the corresponding low rank primal solution. We provide a new dual block coordinate descent algorithm for solving the dual problem with a few spectral constraints. Empirical results illustrate the effectiveness of our method in comparison to recently proposed …
-
Error-correcting codes on low néron-severi rank surfaces
… surfaces whose N´eron-Severi group has low rank. If the rank of the N´eron-Severi group of a surface is 1, the intersection of this surface with an irreducible surface of lower degree will be an irreducible curve, and this allows the construction of ”good” codes and we can have a good …
-
Generating sequences and semigroups of valuations on 2 dimensional normal local rings
… is a polynomial ring over K and v is a rational rank 1 valuation of the field K(X, Y) which dominates K[X, Y](X,Y) . Given a finite Abelian group H acting diagonally on K[X, Y], and a generating sequence of v in K[X, Y] whose members are eigenfunctions for the action of H, we compute a generating …
-
Second-generation polyalgorithms for parallel dense-matrix multiplication
… dense matrix multiplication region. We add a rank-k-based SUMMA algorithm, which performs better than rank-1-based SUMMA. We studied performance on two cluster systems and results show the performance and improvements achieved. We compare and contrast our results with COSMA, a recent, highly …
-
CONVERGENGE ANALYSIS ON SVD-BASED ALGORITHMS FOR TENSOR LOW RANK APPROXIMATIONS
… the classical problem of finding the best rank-R CANDECOMP/PARAFAC(CP) approximation with diff erent cases R > 1 and R = 1 respectively. Unlike the rank-1 approximation is theoretically guaranteed to have a global optimum, general rank-R approximation (R > 1) may not exist in real space. …
-
Power Integral Points on Elliptic Curves
… obtaining upper bounds on p for the seventy-two rank 1 Mordell curves in the range |D| < 200 to possess a pth perfect power. This is done by consideration of the finite number of rational and irrational newforms corresponding to an also finite number of levels of these newforms: in thirty cases …
-
Efficient and Robust Black-box Integral-approximation and Optimization
… approximation, we develop a simple closed-form rank-1 lattice construction method based on group theory. Our method reduces the number of distinct pairwise distance values to generate a more regular lattice. Furthermore, we investigate structured points set for integral approximation on …
-
An examination of outliers and interaction in a nonreplicated two-way table
… for an additive-plus-multiplicative model of rank 1 to a rank k model. Several examples studying the influence in a two-way nonreplicated table are given.
-
Reducibility and computational lower bounds for problems with planted sparse structure
… planted dense subgraph, biclustering, sparse rank-1 submatrix, sparse PCA and the subgraph stochastic block model. Our results demonstrate that, despite the delicate nature of average-case reductions, using natural problems as intermediates can often be beneficial, as is the case in worst-case …
-
Computer vision based corn kernel quality evaluation: Traditional versus machine learning
… experiments show that multi-class SVM reaches a rank-1 accuracy of 78%, while the deep learning detectors achieved96% precision. While the multi-class SVM approach shows good classification results, deep learning models provide more precise detection results.Unfortunately, previous works are all …
-
The topology of terminal quartic 3-folds
… be a terminal Gorenstein Fano 3-fold with Picard rank 1. Denote by s(Y )=h_4 (Y )-h^2 (Y ) = h_4 (Y )-1 the defect of Y. A variety is Q-factorial when every Weil divisor is Q-Cartier. The defect of Y is non-zero precisely when the Fano 3-fold Y is not Q-factorial. Very little is known about the …
-
Compact Symmetric Spaces, Triangular Factorization, and Cayley Coordinates
… part of d) using elementary techniques in rank 1 cases; 3) they are useful in explicitly calculating Evens-Lu Poisson structures on U=K (see [Caine(2006)]). Our set-up involves choosing specific representations of the various u in su(n;C) that are compatible with θ; that is, θ fixes each of …
Page 1 of 2