Results 1  10
of
3,212
ELEMENTARY PROPERTIES
"... The equations governing the equilibrium of a perfectly conducting fluid in the presence of a magnetic ..."
Abstract
 Add to MetaCart
The equations governing the equilibrium of a perfectly conducting fluid in the presence of a magnetic
Elementary Properties Of The Finite Ranks
 Mathematical Logic Quarterly
, 1998
"... . This note investigates the class of finite initial segments of the cumulative hierarchy of pure sets. We show that this class is firstorder definable over the class of finite directed graphs and that this class admits a firstorder definable global linear order. We apply this last result to show ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
that FO(!; BIT) = FO(BIT): This note establishes some elementary properties of the finite initial segments of the cumulative hierarchy of pure sets. We define the sets Vn ; n 2 ! by induction as follows: V 0 = ;; Vn+1 = P(Vn ): (Here, P(X) is the power set of X; that is, the set of all subsets of X
Elementary properties of free groups
 Trans. Amer. Math. Soc
, 1973
"... ABSTRACT. In this paper we show that several classes of elementary properties (properties definable by sentences of a first order logic) of groups hold for all nonabelian free groups. These results are obtained by examining special embeddings of these groups into one another which preserve the prope ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
ABSTRACT. In this paper we show that several classes of elementary properties (properties definable by sentences of a first order logic) of groups hold for all nonabelian free groups. These results are obtained by examining special embeddings of these groups into one another which preserve
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
ELEMENTARY PROPERTIES OF THE SUBTRACTIVE EUCLIDEAN ALGORITHM
, 1990
"... In a recent article in this journal, T. Moore [4] used a microcomputer to make a study of the length of the Euclidean algorithm in determining the greatest common divisor of two nonzero integers m9 n. Our intention is to make a similar study of the lengths of the subtractive Euclidean algorithm. Rec ..."
Abstract
 Add to MetaCart
In a recent article in this journal, T. Moore [4] used a microcomputer to make a study of the length of the Euclidean algorithm in determining the greatest common divisor of two nonzero integers m9 n. Our intention is to make a similar study of the lengths of the subtractive Euclidean algorithm. Recall
Scalespace and edge detection using anisotropic diffusion
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1990
"... AbstractThe scalespace technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically meaningful ” edges at coarse sca ..."
Abstract

Cited by 1887 (1 self)
 Add to MetaCart
that the “no new maxima should be generated at coarse scales ” property of conventional scale space is preserved. As the region boundaries in our approach remain sharp, we obtain a high quality edge detector which successfully exploits global information. Experimental results are shown on a number of images
A new Smarandache function and its elementary properties
"... Abstract For any positive integer n, we define a new Smarandache function G(n) as the smallest positive integer m such that m∏ k=1 φ(k) is divisible by n, where φ(n) is the Euler function. The main purpose of this paper is using the elementary methods to study the elementary properties of G(n), and ..."
Abstract
 Add to MetaCart
Abstract For any positive integer n, we define a new Smarandache function G(n) as the smallest positive integer m such that m∏ k=1 φ(k) is divisible by n, where φ(n) is the Euler function. The main purpose of this paper is using the elementary methods to study the elementary properties of G
Elementary properties of minimal and maximal points in Zariski spectra
 University of Manchester, School of Mathematics, Oxford Road, Manchester
, 2010
"... Abstract. We investigate connections between arithmetic properties of rings and topological properties of their prime spectrum. Any property that the prime spectrum of a ring may or may not have, defines the class of rings whose prime spectrum has the given property. We ask whether a class of rings ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. We investigate connections between arithmetic properties of rings and topological properties of their prime spectrum. Any property that the prime spectrum of a ring may or may not have, defines the class of rings whose prime spectrum has the given property. We ask whether a class of rings
Some Cobweb Posets Digraphs’ Elementary Properties and Questions
, 2008
"... A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of dibigraphs (d ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of di
ELEMENTARY PROPERTIES OF DISTRIBUTIVE LATTICE FREE PRODUCTS
"... ABSTRACT. Let D be the variety of all distributive lattices and let * denote the Dfree product operation. In answering a question of G. Gr•itzer, a distributive lattice A, of rather large cardinality, is constructed with the property that for any B GD, A is an elementary substructure of A*B. Hence ..."
Abstract
 Add to MetaCart
ABSTRACT. Let D be the variety of all distributive lattices and let * denote the Dfree product operation. In answering a question of G. Gr•itzer, a distributive lattice A, of rather large cardinality, is constructed with the property that for any B GD, A is an elementary substructure of A*B. Hence
Results 1  10
of
3,212