Results 1  10
of
1,663
Scaled trace forms of central simple algebras
 Math.Z
, 1996
"... this article we examine a generalization of trace forms to "scaled trace forms" which are defined via the reduced trace map together with scaling by a nonzero element of the algebra ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this article we examine a generalization of trace forms to "scaled trace forms" which are defined via the reduced trace map together with scaling by a nonzero element of the algebra
Embeddings into the Medvedev and Muchnik lattices of Π0 1 classes
 Archive for Mathematical Logic
, 2004
"... Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of nonempty Π 0 1 subsets of 2 ω, under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are latticeembeddable below any nonzero ele ..."
Abstract

Cited by 26 (17 self)
 Add to MetaCart
element of Pw. We show that many countable distributive lattices are latticeembeddable below any nonzero element of PM. 1
A NOTE ON COINCIDENCE ISOMETRIES OF MODULES IN EUCLIDEAN SPACE
, 2008
"... It is shown that the coincidence isometries of certain modules in Euclidean nspace can be decomposed into a product of at most n coincidence reflections defined by their nonzero elements. This generalizes previous results obtained for lattices to situations that are relevant in quasicrystallograph ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
It is shown that the coincidence isometries of certain modules in Euclidean nspace can be decomposed into a product of at most n coincidence reflections defined by their nonzero elements. This generalizes previous results obtained for lattices to situations that are relevant
Packing nonzero Apaths . . .
 COMBINATORICA 26 (5) (2006) 521–532
, 2006
"... Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊆V. An Apath is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertexdisjoint Apaths each of nonzero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader’s Spaths problem. We prove that for any
Archive for Mathematical Logic
, 2003
"... Abstract Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of nonempty \Pi 01 subsets of 2!, under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are latticeembeddable below any nonzero element of Pw. We show th ..."
Abstract
 Add to MetaCart
Abstract Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of nonempty \Pi 01 subsets of 2!, under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are latticeembeddable below any nonzero element of Pw. We show
NAG Fortran Library Routine Document
"... Note: before using this routine, please read the Users ’ Note for your implementation to check the interpretation of bold italicised terms and other implementationdependent details. 1 Purpose F11ZNF sorts the nonzero elements of a complex sparse nonHermitian matrix, represented in coordinate stor ..."
Abstract
 Add to MetaCart
Note: before using this routine, please read the Users ’ Note for your implementation to check the interpretation of bold italicised terms and other implementationdependent details. 1 Purpose F11ZNF sorts the nonzero elements of a complex sparse nonHermitian matrix, represented in coordinate
Uncountably Generated Algebras of Everywhere Surjective Functions
"... We show that there exists an uncountably generated algebra every nonzero element of which is an everywhere surjective function on C, that is, a function f: C → C such that, for every non void open set U ⊂ C, f(U) = C. ..."
Abstract
 Add to MetaCart
We show that there exists an uncountably generated algebra every nonzero element of which is an everywhere surjective function on C, that is, a function f: C → C such that, for every non void open set U ⊂ C, f(U) = C.
A branch and bound algorithm for the matrix, bandwidth minimization
 European Journal of Operational Research
, 2008
"... Abstract — In this article we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the nonzero elements in a band that i ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract — In this article we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the nonzero elements in a band
A Genetic Programming Approach to the Matrix BandwidthMinimization Problem
"... Abstract. The bandwidth of a sparse matrix is the distance from the main diagonal beyond which all elements of the matrix are zero. The bandwidth minimisation problem for a matrix consists of finding the permutation of rows and columns of the matrix which ensures that the nonzero elements are locat ..."
Abstract
 Add to MetaCart
Abstract. The bandwidth of a sparse matrix is the distance from the main diagonal beyond which all elements of the matrix are zero. The bandwidth minimisation problem for a matrix consists of finding the permutation of rows and columns of the matrix which ensures that the nonzero elements
Robust Recovery of Signals From a Structured Union of Subspaces
, 2008
"... Traditional sampling theories consider the problem of reconstructing an unknown signal x from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that x lies in a known subspace. Recently, there has been growing interest in nonlinear but structu ..."
Abstract

Cited by 221 (47 self)
 Add to MetaCart
possibilities. The samples are modelled as inner products with an arbitrary set of sampling functions. To derive an efficient and robust recovery algorithm, we show that our problem can be formulated as that of recovering a blocksparse vector whose nonzero elements appear in fixed blocks. We then propose a
Results 1  10
of
1,663