 IDEALS Home
 →
 Browse by Subject
Browse by Subject "Mathematics"
Now showing items 7392 of 996

application/pdf
PDF (5MB) 
(1989)We use R. Knorr's theory of virtually irreducible lattices to study the blocks of a finite group.
application/pdf
PDF (2MB) 
BooleanValued Models of Set Theory When the Boolean Algebra Is a Proper Class in the Ground Model (1971)
application/pdf
PDF (2MB) 
(1989)In this paper the Boolean valued method is used to develop a theory closely resembling the theory of probabilistic metric spaces. In this development the complete Boolean algebra used must have the form of the quotient ...
application/pdf
PDF (3MB) 
application/pdf
PDF (4MB) 
(1991)An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary methodbased domain decomposition or BMDD, ...
application/pdf
PDF (5MB) 
(1969)
application/pdf
PDF (3MB) 
(1958)
application/pdf
PDF (2MB) 
(2005)Moreover, in both cases above we give a characterization of dividing.
application/pdf
PDF (2MB) 
(1981)We study binary errorcorrecting and errordetecting codes suitable for use on a completely asymmetric or Z channel. This channel accepts inputs of 0 and 1 and reproduces these faithfully as outputs, except that occasionally ...
application/pdf
PDF (3MB) 
application/pdf
PDF (3MB) 
(1989)A family of polytopes in E$\sp{d}$ is called nearly neighborly if, for every two members of the family, there is a hyperplane which separates them and contains a facet of each. Such a family is called neighborly if every ...
application/pdf
PDF (4MB) 
(1982)The Renyi redundancy, R(,s)(p,w), is the difference between the exponentially weighted average codeword length,
application/pdf
PDF (2MB) 
(1994)Suppose X is a submartingale that is continuous on the right with limits from the left and H is a predictable process bounded by 1 in absolute value. Let $Y = (Y\sb{t})\sb{t\ge 0}$ where$$Y\sb{t} = H\sb0X\sb0 + ...
application/pdf
PDF (2MB) 
(2006)We use the partial description of cohomology to reconstruct the tree T from a given four strand tree braid group B 4T up to homeomorphism. Thus tree braid groups B4T and trees T (up to homeomorphism) are in bijective ...
application/pdf
PDF (3MB) 
(1993)Hamiltonian systems possess dynamics (e.g., preservation of volume in phase space and symplectic structure) that call for special numerical integrators, namely canonical methods. Recent research in this aspect have shown ...
application/pdf
PDF (4MB) 
(1988)Let F be a finite extension of $\doubq\sb{p}$. Let L/F be a normal, totally ramified extension of degree $p\sp{2n}$ with ${\cal B}$ the maximal ideal of ${\cal D}\sb{\rm L}$. Suppose the Hilbert sequence for L/F has a ...
application/pdf
PDF (1MB) 
application/pdf
PDF (2MB) 
(1993)We establish the decomposition by the Arnold cat map of a uniform lattice of prime$\sp2$ sites into periodic orbits. We give a first integral (constant of motion) of this dynamical system and use it to find additional ...
application/pdf
PDF (1MB) 
application/pdf
PDF (6MB)
Now showing items 7392 of 996