Physical Sciences and Mathematics Commons^™

Objectivity, Information, And Maxwell's Demon, Steven Weinstein

Dartmouth Scholarship

This paper examines some common measures of complexity, structure, and information, with an eye toward understanding the extent to which complexity or information‐content may be regarded as objective properties of individual objects. A form of contextual objectivity is proposed which renders the measures objective, and which largely resolves the puzzle of Maxwell's Demon.

Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr.

Doctoral Theses

Interest in digital images stems mostly from its application to various areas of computer vision [33, 57] and pattern recognition [145). Problems include robotic vision and con- trol, geographic and topographic map matching, target recognition, space applications, character recognition, scene analysis, fingerprint and face recognition, etc. Lately, with the advent of content-based image retrieval (CBIR) and proliferation of the Internet, digital imaging applications are in vogue now than ever before. In almost all the cases, the data size is enormously large, and at the same time, fast on-line as well as real- time computation is needed. For example, in fingerprint …

Σary, Minnesota State University Moorhead, Mathematics Department

Math Department Newsletters

No abstract provided.

Discovering Properties Of Complex Numbers By Starting With Known Properties Of Real Numbers, Esther D. Hatch

Honors College

No abstract provided.

Essays In Financial Intermediation., Bappaditya Mukhopadhyay Dr.

Doctoral Theses

No abstract provided.

On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.

Doctoral Theses

We investigate approximability of both maximum and minimum linear ordering problems (MAX-LOP and MIN-LOP) and several related problems such as the well known feedback set problems, acyclie subdigraph problem and several others and their variants.We show that both MAX-LOP and MIN-LOP are strongly NP-complete, and MIN- LOP, MIN-QAP(S) (a special case of minimum quadratic assignment problem) and MIN-W-FAS are equivalent with respect to strict-reduction. The strict-equivalence is also established among these problems as well as MIN-W-FVS, with weights on arcs/vertices bounded by a polynomial, and the unweighted versions of the feedback set. problems. We also show that MAX-LOP is strict-equivalent …

Deformation Theory Of Dialgebras., Anita Majumdar Dr.

Doctoral Theses

The main objective of this thesis is to develop an algebraic deformation theury for associative dialgebras, which are binary quadratic algebras discovered by J.-L. Loday in (16). (17), and subisequently, to derive a G-algebra siructure ou the dialgebra colhomology with cocfticients in itself.Deformation theory dates back at Ieast to Riemann's 1837 memoir on alelian fianetions in which he studied IHanifolds of complex dimension one and calculated the mumber of parameters (called moduli) upon which a deformation depends. The modern theory of deformations of structures on manifolds was developed extensively ly Frolicher-Kodaira-Nijenhnis-Nirenberg-Spencer (13], [14], [15). [25|, [26).The study of deformations of …

Spectral Triples And Metric Aspects Of Geometry On Some Noncommutative Spaces., Partha Sarathi Chakraborty Dr.

Doctoral Theses

Quantization of mathematical theories is now more than half a century old idea in mathe- matics. It goes back to Gelfand-Naimarks seminal paper [37] in 1943. As the name suggests noncommutative geometry is the quantization" of differential geometry. It is the study of noncommutative algebras as if they were algebras of functions on spaces like the commuta- tive algebras associated to affine algebraic varieties, smooth manifolds, topological spaces. One can trace its roots in the Gelfand-Naimark theorems (1943, 37]). In modern terminol- ogy their theorem says there is an antiequivalence between the category of (locally) compact Hausdorff spaces and (proper, …

Bounding The Number Of Graphs Containing Very Long Induced Paths, Steven Kay Butler

Theses and Dissertations

Induced graphs are used to describe the structure of a graph, one such type of induced graph that has been studied are long paths.

In this thesis we show a way to represent such graphs in terms of an array with two colors and a labeled graph. Using this representation and the techniques of Polya counting we will then be able to get upper and lower bounds for graphs containing a long path as an induced subgraph.

In particular, if we let P(n,k) be the number of graphs on n+k vertices which contains P_n, a path on n vertices, as …

Resources Related To Mathematics, Art And Nature, Vicki Beitler

Sabbaticals

The purpose of my sabbatical work was to learn about resources related to mathematics and art, nature, music and architecture. These subjects appeal to a wide audience, yet their mathematical connections are often on the periphery of a mathematics student's studies. In this way I planned to increase my knowledge of mathematics but at the same time broaden my understanding of cross-disciplinary subjects.

Boundary Volume And Length Spectra Of Riemannian Manifolds: What The Middle Degree Hodge Spectrum Doesn't Reveal, Carolyn S. Gordon, Juan P. Rossetti

Dartmouth Scholarship

No abstract provided.

A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (In Traditional Chinese), Florentin Smarandache, Feng Liu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.