Mathematics Commons^™

The Method Of Lagrange Multipliers, William Trench

Mathematics Faculty Research

This is a supplement to the author's "Introduction to Real Analysis." It has been judged to meet the evaluation criteria set by the Editorial Board of the American Institute of Mathematics in connection with the Institute's Open Textbook Initiative. It may be copied, modified, redistributed, translated, and built upon subject to the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. A complete instructor's solution manual is available by email to [email protected], subject to verification of the requestor's faculty status.

Bayesian Approach For Inconsistent Information, M. Stein, Michael Beer, Vladik Kreinovich

Departmental Technical Reports (CS)

In engineering situations, we usually have a large amount of prior knowledge that needs to be taken into account when processing data. Traditionally, the Bayesian approach is used to process data in the presence of prior knowledge. Sometimes, when we apply the traditional Bayesian techniques to engineering data, we get inconsistencies between the data and prior knowledge. These inconsistencies are usually caused by the fact that in the traditional approach, we assume that we know the {\it exact} sample values, that the prior distribution is {\it exactly} known, etc. In reality, the data is imprecise due to measurement errors, the …

Topological Symmetry Groups Of Graphs In 3-Manifolds, Erica Flapan, Harry Tamvakis

Pomona Faculty Publications and Research

We prove that for every closed, connected, orientable, irreducible 3-manifold there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group G there is an embedding T of some graph in a hyperbolic rational homology 3-sphere such that the topological symmetry group of T is isomorphic to G.

The Complexity Of Linear Algebra, Leann Kay Christensen

Theses Digitization Project

This study examines the complexity of linear algebra. Complexity means how much work, or the number of calculations or time it takes to perform a task. As linear algebra is used more and more in different fields, it becomes useful to study ways of reducing the amount of work required to complete basic procedures.

A Study Of Finite Symmetrical Groups, May Majid

Theses Digitization Project

This study investigated finite homomorphic images of several progenitors, including 2*⁵ : S₅, 2*⁶ : A₆, and 3*⁵ : C₅ The technique of manual of double coset enumeration is used to construct several groups by hand and computer-based proofs are given for the isomorphism types of the groups that are not constructed.

Enumeration And Symmetric Presentations Of Groups, With Music Theory Applications, Jesse Graham Train

Theses Digitization Project

The purpose of this project is to construct groups as finite homomorphic images of infinite semi-direct products. In particular, we will construct certain classical groups and subgroups of sporadic groups, as well groups with applications to the field of music theory.

Plasma Confinement: Mathematical Modeling Of A Fusion Reactor, James Scott Jones

Theses Digitization Project

This study will discuss currently used power sources and their drawbacks, leading to covering fusion as an energy source and its potential. Fusion has three significant important advantages: Fuel reserves, safety, and environment. A significant amount of fuel reserves comes from the natural occurrence in ocean water of deuterium at a 1 to 6700 ratio, accounting for the energy supply being on the order of 2 billion years. Fusion does not produce any greenhouse gases and its only 'exhaust' is that of harmless inert helium.

Hyperbolicity Equations For Knot Complements, Christopher Martin Jacinto

Theses Digitization Project

This study analyzes Carlo Petronio's paper, An Algorithm Producing Hyperbolicity Equations for a Link Complement in S³. Using the figure eight knot as an example, we will explain how Petronio's algorithm was able to decompose the knot complement of an alternating knot into tetrahedra. Then, using the vertex invariants of these tetrahedra, we will explain how Petronio was able to create hyperbolicity equations.

A Study Of Different Modeling Choices For Simulating Platelets Within The Immersed Boundary Method, Varun Shankar, Grady B. Wright, Aaron L. Fogelson, Robert M. Kirby

Mathematics Faculty Publications and Presentations

The Immersed Boundary (IB) method is a widely-used numerical methodology for the simulation of fluid–structure interaction problems. The IB method utilizes an Eulerian discretization for the fluid equations of motion while maintaining a Lagrangian representation of structural objects. Operators are defined for transmitting information (forces and velocities) between these two representations. Most IB simulations represent their structures with piecewise linear approximations and utilize Hookean spring models to approximate structural forces. Our specific motivation is the modeling of platelets in hemodynamic flows. In this paper, we study two alternative representations – radial basis functions (RBFs) and Fourier-based (trigonometric polynomials and spherical …

Generalized Least-Squares Regressions Ii: Theory And Classification, Nataniel Greene

Publications and Research

In the first paper of this series, a variety of known and new symmetric and weighted least-squares regression methods were presented with efficient derivations. This paper continues and generalizes the previous work with a theory for deriving, analyzing, and classifying all symmetric and weighted least-squares regression methods.

Bekenstein Bound Of Information Number N And Its Relation To Cosmological Parameters In A Universe With And Without Cosmological Constant, Ioannis Haranas, Ioannis Gkigkitzis

Physics and Computer Science Faculty Publications

Bekenstein has obtained is an upper limit on the entropy S, and from that, an information number bound N is deduced. In other words, this is the information contained within a given finite region of space that includes a finite amount of energy. Similarly, this can be thought as the maximum amount of information required to perfectly describe a given physical system down to its quantum level. If the energy and the region of space are finite then the number of information N required in describing the physical system is also finite. In this short letter two information number …

The Number Of Information Bits Related To The Minimum Quantum And Gravitational Masses In A Vacuum Dominated Universe, Ioannis Haranas, Ioannis Gkigkitzis

Physics and Computer Science Faculty Publications

Wesson obtained a limit on quantum and gravitational mass in the universe by combining the cosmological constant Λ, Planck’s constant h , the speed of light c, and also the gravitational constant G. The corresponding masses are 2.0 x 10^-62 and 2.3 x 10⁵⁴ kg respectively, and in general can be obtained with the help of a generic dimensional analysis, or from an analysis where the cosmological constant appears in a four dimensional space-time and as a result of a higher dimensional reduction. In this paper our goal is to establish a relation for both quantum …

Number Of Information And Its Relation To The Cosmological Constant Resulting From Landauer’S Principle, Ioannis Gkigkitzis, Ioannis Haranas, Samantha Kirk

Physics and Computer Science Faculty Publications

Using a recent published formula for the number of information N that results from Landauer’s principle we obtain an expression for the cosmological constant Λ . Next, assuming the universe as a system of mass M satisfying Landauer’s principle and eliminating its mass M from the given expression for the number of information, we obtain a new expression that agrees with the one derived by Lloyd. Furthermore, we modify the generalized entropy relation and three equivalent entropy expressions are obtained. Finally, in two different universes the time rate of change of the entropy is calculated. In a flat universe the …

Pointless Hyperelliptic Curves, Ryan P. Becker, Darren B. Glass

Math Faculty Publications

In this paper we consider the question of whether there exists a hyperelliptic curve of genus g which is defined over but has no rational points over for various pairs . As an example of such a result, we show that if p is a prime such that is also prime then there will be pointless hyperelliptic curves over of every genus.

Solitary Wave And Shock Wave Solutions Of The Variants Of Boussinesq Equations, Houria Triki, Abhinandan Chowdhury, Anjan Biswas

Math Faculty Publications

This paper obtains the solitary wave as well as the shock wave solutions of the variants of the Boussinesq equations in both (1+1) and (1+2) dimensions. The domain restrictions are also identified in the process.

A State-Dependent Delay Equation With Negative Feedback And ‘Mildly Unstable’ Rapidly Oscillating Periodic Solutions, Benjamin B. Kennedy

Math Faculty Publications

We consider state-dependent delay equations of the form x′(t)=f(x(t−d(x(t)))) where d is smooth and f is smooth, bounded, nonincreasing, and satisfies the negative feedback condition xf(x)x≠0. We identify a special family of such equations each of which has a ``rapidly oscillating" periodic solution p. The initial segment p0 of p is the fixed point of a return map R that is differentiable in an appropriate setting.

We show that, although all the periodic solutions p we consider are unstable, the stability can be made arbitrarily mild in the sense that, given ϵ>0, we can choose f and d such …

Symmetric Random Walks On Homeo+(R), B. Deroin, V. Klepstyn, A. Navas, Kamlesh Parwani

Faculty Research and Creative Activity

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence. Except for a few special cases, which can be treated separately, we prove a property of "global stability at a finite distance": roughly speaking, there exists a compact interval such that any two trajectories get closer and closer whenever one of them returns to the compact interval. The probabilistic techniques employed here lead to interesting results for the study of group actions on the …

A Gentle Introduction To Pythontex, Andrew Mertz, William Slough

Faculty Research and Creative Activity

No abstract provided.

School Choice As A One-Sided Matching Problem: Cardinal Utilities And Optimization, Sinan Aksoy, Alexander Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu

Pomona Faculty Publications and Research

The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. Previously considered criteria for evaluating proposed mechanisms such as stability, strategyproofness and Pareto efficiency do not always translate into desirable student assignments. In this note, we explore a class of one-sided, cardinal utility maximizing matching mechanisms focused exclusively on student preferences. We adapt a well-known combinatorial optimization technique (the Hungarian algorithm) as the kernel of this class of matching mechanisms. We find that, while such mechanisms can be adapted to meet desirable criteria not met by …

On The Norm Closure Problem For Complex Symmetric Operators, Stephan Ramon Garcia, Daniel E. Poore '11

Pomona Faculty Publications and Research

We prove that the set of all complex symmetric operators on a separable, infinite-dimensional Hilbert space is not norm closed.