Browsing Mathematics Department by Title

Now showing items 1-20 of 45

Almost completely decomposable groups with two critical types and their endomorphism rings

Lewis, Wayne (1992)
Almost global feedack control of autonomous underwater vehicles

Singh, Shashi Bhushan (University of Hawaii at Manoa, 2009)

An Autonomous Underwater Vehicle (AUV) is expected to operate in an aquatic environment and compensate for poorly known disturbance forces and moments. Due to uncertain environment, it is difficult to apply an open-loop ...
A-T-menability of groups

Lu, Ni Yen (University of Hawaii at Manoa, 2011)

This paper presents a detailed study of a-T-menable discrete groups. Starting with several conditions required for a-T-menability, we prove that they are equivalent and hence charaterize a class of a-T-menable discrete ...
Automated reasoning and machine learning

Huang, Guoxiang (1996)
A brief survey of the discrete logarithm problem

Sia, Gretel S. (University of Hawaii at Manoa, 2011)

The Discrete Logarithm Problem (DLP) has been the subject of interest among many mathematicians and cryptographers in recent times because of its computational di¢ culty. For the former, the enormity of the mathematics ...
Classes of Linear Operators and the Distribution of Zeros of Entire Functions

Piotrowski, Andrzej (University of Hawaii at Manoa, 2007)

Motivated by the work of Pólya, Schur, and Turán, a complete characterization of multiplier sequences for the Hermite polynomial basis is given. Laguerre's theorem and a remarkable curve theorem due to Pólya are generalized. ...
Combinatorial remedies

Mackey, John Fletcher (1994)
Complex reflection group coding

Kim, Hye Jung (University of Hawaii at Manoa, 2011)

This paper considers complex reflection groups for which the generalization of subgroup decoding method does not work at all are considered in this paper. A new method of decoding is introduced to effectively encode and ...
Congruence Lattices of Finite Algebras

DeMeo, William J. (University of Hawaii at Manoa, 2012)

An important and long-standing open problem in universal algebra asks whether every finite lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is resolved, our understanding of finite ...
Core and no-treat equilibrium in tournament games with externalities

Mizuno, Ryo (University of Hawaii at Manoa, 2010)

We consider a situation where coalitions are formed to divide a resource. As in real life, the value of a payoff to a given agent is allowed to depend on the payoff to other agents with whom he shares a common interest. ...
A covering space approach to (d,k) constrained codes

Perry, Patrick Neil (1992)
Differential Equations

Bear, H. S. Jr (Addison-Wesley Publishing Company, 1962)
Dual linear spaces generated by a non-Desarguesian configuration

Seffrood, Jiajia Yang Garcia (2005)
Equations implying congruence n-permutability and semidistributivity

Freese, Ralph (2013-02-08)

T. Dent, K. Kearnes and A. Szendrei de ne the derivative, 0, of a set of equations and show, for idempotent , that implies congruence modularity if 0 is inconsistent ( 0 j= x y). In this paper we investigate ...
Extending lp--decoding for permutation codes from euclidean to Kendall tau metric

Kong, Justin (University of Hawaii at Manoa, 2012)

Invented in the 1960’s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications. In 2011 a decoding method ...
Finite group graded lie algebraic extensions and trefoil symmetric relativity, standard model, yang mills and gravity theories

Wills, Luis Alberto (2008)
A generalization of Euler's constant

Hedley, Mark (University of Hawaii at Manoa, 2011)
Generalized Gelfand triples

Casteren, J. A. van ([Honolulu], 1971)
Geometry and singularities of spatial and spherical curves

Xiong, Jianfei (2004)
How much randomness is needed for statistics?

Kjos-Hanssen, Bjoern (2012-11-05)

In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure λ, a choice needs to be made. One approach is to allow randomness tests to access the measure λ as an ...