Results 1  10
of
229,640
THE FINITE BASIS PROBLEM
"... Abstract. A finite algebra of finite type (i.e., having just finitely many fundamental operations) is finitely based if the variety it generates can be axiomatized by just finitely many equations. The finite basis problem asks for an explicit characterization of the finite algebras of finite type wh ..."
Abstract
 Add to MetaCart
Abstract. A finite algebra of finite type (i.e., having just finitely many fundamental operations) is finitely based if the variety it generates can be axiomatized by just finitely many equations. The finite basis problem asks for an explicit characterization of the finite algebras of finite type
Finite Basis Problems and Results For Quasivarieties
, 2004
"... Let K be a finite collection of finite algebras of finite signature such that SP(K) has meet semidistributive congruence lattices. We prove that there exists a finite collection K1 of finite algebras of the same signature, K1 ⊇ K, such that SP(K1) is finitely axiomatizable. We show also that if HS ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
that if HS(K) ⊆ SP(K), then SP(K) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract indicates.
A finite basis for failure semantics
 In Proceedings 32nd Colloquium on Automata, Languages and Programming (ICALP’05), Lisbon, LNCS 3580
, 2005
"... Abstract. We present a finite ωcomplete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12]. 1 ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
Abstract. We present a finite ωcomplete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12]. 1
A Simple Proof of the Restricted Isometry Property for Random Matrices
 CONSTR APPROX
, 2008
"... We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided algorithmical ..."
Abstract

Cited by 631 (64 self)
 Add to MetaCart
algorithmically simple proofs of the Johnson–Lindenstrauss lemma; and (ii) covering numbers for finitedimensional balls in Euclidean space. This leads to an elementary proof of the Restricted Isometry Property and brings out connections between Compressed Sensing and the Johnson–Lindenstrauss lemma. As a result
The finite basis problem for monoids of triangular boolean matrices
"... We show that the monoid of all $n\cross n $ upper triangular boolean matrices has no finite identity basis whenever $n>3 $. The identities of its submonoid consisting of matrices in which all diagonal entries are 1 possess a finite basis if and only if $n\leq 4 $. 1 The finite basis problem for m ..."
Abstract
 Add to MetaCart
We show that the monoid of all $n\cross n $ upper triangular boolean matrices has no finite identity basis whenever $n>3 $. The identities of its submonoid consisting of matrices in which all diagonal entries are 1 possess a finite basis if and only if $n\leq 4 $. 1 The finite basis problem
A Practical Guide to Wavelet Analysis
, 1998
"... A practical stepbystep guide to wavelet analysis is given, with examples taken from time series of the El Nio Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finitelength t ..."
Abstract

Cited by 869 (3 self)
 Add to MetaCart
A practical stepbystep guide to wavelet analysis is given, with examples taken from time series of the El Nio Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finite
Results 1  10
of
229,640