Bicircular Matroids With Circuits Of At Most Two Sizes, 2010 University of Mississippi

#### Bicircular Matroids With Circuits Of At Most Two Sizes, Torina Deachune Lewis

*Electronic Theses and Dissertations*

Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicardinal Matroids and Finite Geometries in 1968, was the first to study matroids with all hyperplanes having the same size. Murty called such a matroid an ``Equicardinal Matroid''. Young renamed such a matroid a ``Matroid Design''. Further work on determining properties of these matroids was done by Edmonds, Murty, and Young in their papers published in 1972, 1973, and 1970 respectively. These authors were able to connect the problem of determining the matroid designs with specified parameters with results on balanced incomplete block designs ...

Methods Of Variational Analysis In Pessimistic Bilevel Programming, 2010 Wayne State University

#### Methods Of Variational Analysis In Pessimistic Bilevel Programming, Samarathunga M. Dassanayaka

*Wayne State University Dissertations*

Bilevel programming problems are of growing interest both from theoretical and practical points of view. These models are used in various applications, such as economic planning, network design, and so on. The purpose of this dissertation is to study the pessimistic (or strong) version of bilevel programming problems in finite-dimensional spaces. Problems of this type are intrinsically nonsmooth (even for smooth initial data) and can be treated by using appropriate tools of modern variational analysis and generalized differentiation developed by B. Mordukhovich.

This dissertation begins with analyzing pessimistic bilevel programs, formulation of the problems, literature review, practical application, existence of ...

The Fundamental Gap For Hyperbolic Triangles, 2010 Bucknell University

#### The Fundamental Gap For Hyperbolic Triangles, Dennis Stuart Fillebrown

*Honors Theses*

In 1983, M. van den Berg made his Fundamental Gap Conjecture about the difference between the first two Dirichlet eigenvalues (the fundamental gap) of any convex domain in the Euclidean plane. Recently, progress has been made in the case where the domains are polygons and, in particular, triangles. We examine the conjecture for triangles in hyperbolic geometry, though we seek an for an upper bound for the fundamental gap rather than a lower bound.

Multiresolution Inverse Wavelet Reconstruction From A Fourier Partial Sum, 2010 CUNY Kingsborough Community College

#### Multiresolution Inverse Wavelet Reconstruction From A Fourier Partial Sum, Nataniel Greene

*Publications and Research*

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities.In previous work [11,12] we described a numerical procedure for overcoming the Gibbs phenomenon called the Inverse Wavelet Reconstruction method (IWR). The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series. However, we only described the method standard wavelet ...

The Maximum Rectilinear Crossing Number Of The Petersen Graph, 2010 CUNY Kingsborough Community College

#### The Maximum Rectilinear Crossing Number Of The Petersen Graph, Elie Feder, Heiko Harborth, Steven Herzberg, Sheldon Klein

*Publications and Research*

We prove that the maximum rectilinear crossing number of the *Petersen graph *is 49. First, we illustrate a picture of the Petersen graph with 49 crossings to prove the lower bound. We then prove that this bound is sharp by carefully analyzing the ten Cs's which occur in the Petersen graph and their properties.

Begin The Adventure : How To Break The Light Barrier By A.D. 2079 (3rd Ed.), 2010 University of New Mexico

#### Begin The Adventure : How To Break The Light Barrier By A.D. 2079 (3rd Ed.), Florentin Smarandache, Homer B. Tilton

*Faculty and Staff Publications*

This edition, the third, has undergone a subtle name change, going from "A.D. 2070" in the title to A.D. 2079 as the timeline is fine-tuned. Because of the almost universal failure to recognize the distinction between physical (reality-based, dynamical) and visual (appearance-based, kinematical) variables, a tremendous volume of mythology arose over the past 100 years centered around Einstein's reality view of the distortions of special relativity. To get a sense of it, we point the reader to Paul J. Nahin's heroic book, Time Machines, 2nd ed.,- to these Tech Notes in particular: TN#6. "A High-Speed ...

From Permutahedron To Associahedron, 2010 Technological University Dublin

#### From Permutahedron To Associahedron, Colum Watt, Thomas Brady

*Articles*

For each finite real reflection group $W$, we identify a copy of the type-$W$ simplicial generalised associahedron inside the corresponding simplicial permutahedron. This defines a bijection between the facets of the generalised associahedron and the elements of the type-$W$ non-crossing partition lattice which is more tractable than previous such bijections. We show that the simplicial fan determined by this associahedron coincides with the Cambrian fan for $W$.

Multispace & Multistructure. Neutrosophic Transdisciplinarity (100 Collected Papers Of Sciences), Vol. Iv, 2010 University of New Mexico

#### Multispace & Multistructure. Neutrosophic Transdisciplinarity (100 Collected Papers Of Sciences), Vol. Iv, Florentin Smarandache

*Faculty and Staff Publications*

The fourth volume, in my book series of “Collected Papers”, includes 100 published and unpublished articles, notes, (preliminary) drafts containing just ideas to be further investigated, scientific souvenirs, scientific blogs, project proposals, small experiments, solved and unsolved problems and conjectures, updated or alternative versions of previous papers, short or long humanistic essays, letters to the editors - all collected in the previous three decades (1980-2010) – but most of them are from the last decade (2000-2010), some of them being lost and found, yet others are extended, diversified, improved versions. This is an eclectic tome of 800 pages with papers in various ...

On The Socles Of Characteristic Subgroups Of Abelian P-Groups, 2010 Technological University Dublin

#### On The Socles Of Characteristic Subgroups Of Abelian P-Groups, Brendan Goldsmith, Peter Danchev

*Articles*

Fully invariant subgroups of an Abelian p-group have been the object of a good deal of study, while characteristic subgroups have received somewhat less attention. Recently the socles of fully invariant subgroups have been studied and this led to the notion of a socle-regular group. The present work replaces the fully invariant subgroups with characteristic ones and leads in a natural way to the notion of a strongly socle-regular group. A surprising relationship, mirroring that between transitive and fully transitive groups, is obtained.

The Influence Of Inclusion On Langauge Arts Literacy And Math Achievement On Non-Disabled Middle School Students, 2010 Seton Hall University

#### The Influence Of Inclusion On Langauge Arts Literacy And Math Achievement On Non-Disabled Middle School Students, Faye Brady

*Seton Hall University Dissertations and Theses (ETDs)*

.

Enumeration Schemes For Permutations Avoiding Barred Patterns, 2009 Valparaiso University

#### Enumeration Schemes For Permutations Avoiding Barred Patterns, Lara Pudwell

*Lara K. Pudwell*

No abstract provided.

Exit Frequency Matrices For Finite Markov Chains, 2009 Macalester College

#### Exit Frequency Matrices For Finite Markov Chains, Andrew Beveridge, László Lovász

*Andrew Beveridge*

No abstract provided.

Exponential Growth Rate Of Paths And Its Connection With Dynamics, 2009 Northwestern University

#### Exponential Growth Rate Of Paths And Its Connection With Dynamics, Pengfei Zhang

*Pengfei Zhang*

No abstract provided.

Q-Partition Algebra Combinatorics, 2009 Macalester College

#### Q-Partition Algebra Combinatorics, Thomas Halverson, N. Theim

*Thomas M. Halverson*

No abstract provided.

Enumeration Schemes For Words Avoiding Permutations, 2009 Valparaiso University

#### Enumeration Schemes For Words Avoiding Permutations, Lara Pudwell

*Lara K. Pudwell*

No abstract provided.

When Does A Category Built On A Lattice With A Monoidal Structure Have A Monoidal Structure?, 2009 Illinois Wesleyan University

#### When Does A Category Built On A Lattice With A Monoidal Structure Have A Monoidal Structure?, Lawrence Stout

*Lawrence N. Stout*

In a word, sometimes. And it gets harder if the structure on L is not commutative. In this paper we consider the question of what properties are needed on the lattice L equipped with an operation * for several different kinds of categories built using Sets and L to have monoidal and monoidal closed structures. This works best for the Goguen category Set(L) in which membership, but not equality, is made fuzzy and maps respect membership. Commutativity becomes critical if we make the equality fuzzy as well. This can be done several ways, so a progression of categories is considered ...

Recursion, Infinity, And Modeling, 2009 Illinois Wesleyan University

#### Recursion, Infinity, And Modeling, Lawrence Stout, Hans-Jorg Tiede

*Lawrence N. Stout*

Hauser, Chomsky, and Fitch (2002) claim that a core property of the human language faculty is recursion and that this property "yields discrete infinity" (2002: 1571) of natural languages. On the other hand, recursion is often motivated by the observation that there are infinitely many sentences that should be generated by a finite number of rules. It should be obvious that one cannot pursue both arguments simultaneously, on pain of circularity. The main aim of this paper is to clarify both conceptually and methodologically the relationship between recursion and infinity in language. We want to argue that discrete infinity is ...

Counting Interesting Elections, 2009 Valparaiso University

#### Counting Interesting Elections, Lara Pudwell, Eric Rowland

*Lara K. Pudwell*

No abstract provided.

List Coloring And N-Monophilic Graphs, 2009 Occidental College

#### List Coloring And N-Monophilic Graphs, Ramin Naimi, Radoslav Kirov

*Ramin Naimi*

In 1990, Kostochka and Sidorenko proposed studying the smallest number of list-colorings of a graph G among all assignments of lists of a given size n to its vertices. We say a graph G is n-monophilic if this number is minimized when identical n-color lists are assigned to all vertices of G. Kostochka and Sidorenko observed that all chordal graphs are n-monophilic for all n. Donner (1992) showed that every graph is n-monophilic for all suﬃciently large n. We prove that all cycles are n-monophilic for all n; we give a complete characterization of 2-monophilic graphs (which turns out to ...

Mathematica In Action: Problem-Solving Through Visualization And Computation, 2009 Macalester College

#### Mathematica In Action: Problem-Solving Through Visualization And Computation, Stan Wagon

*Stan Wagon, Retired*

No abstract provided.