Symbolic Powers Of Ideals In K[PN],
2013
University of Nebraska-Lincoln
Symbolic Powers Of Ideals In K[PN], Michael Janssen
Department of Mathematics: Dissertations, Theses, and Student Research
Let I ⊆ k[PN] be a homogeneous ideal and k an algebraically closed field. Of particular interest over the last several years are ideal containments of symbolic powers of I in ordinary powers of I of the form I(m) ⊆ Ir, and which ratios m/r guarantee such containment. A result of Ein-Lazarsfeld-Smith and Hochster-Huneke states that, if I ⊆ k[PN], where k is an algebraically closed field, then the symbolic power I(Ne) is contained in the ordinary power Ie, and thus, whenever …
On Toric Symmetry Of P1 X P2,
2013
Harvey Mudd College
On Toric Symmetry Of P1 X P2, Olivia D. Beckwith
HMC Senior Theses
Toric varieties are a class of geometric objects with a combinatorial structure encoded in polytopes. P1 x P2 is a well known variety and its polytope is the triangular prism. Studying the symmetries of the triangular prism and its truncations can lead to symmetries of the variety. Many of these symmetries permute the elements of the cohomology ring nontrivially and induce nontrivial relations. We discuss some toric symmetries of P1 x P2, and describe the geometry of the polytope of the corresponding blowups, and analyze the induced action on the cohomology ring. We exhaustively compute the toric symmetries of P1 …
Propeller,
2013
Claremont Colleges
Propeller, Joel Kahn
The Transdisciplinary STEAM+ Journal
This image is based on several different algorithms interconnected within a single program in the language BASIC-256. The fundamental structure involves a tightly wound spiral working outwards from the center of the image. As the spiral is drawn, different values of red, green and blue are modified through separate but related processes, producing the changing appearance. Algebra, trigonometry, geometry, and analytic geometry are all utilized in overlapping ways within the program. As with many works of algorithmic art, small changes in the program can produce dramatic alterations of the visual output, which makes lots of variations possible.
Whitney's 2-Isomorphism Theorem For Hypergraphs,
2013
California State University, San Bernardino
Whitney's 2-Isomorphism Theorem For Hypergraphs, Eric Anthony Taylor
Theses Digitization Project
This study will examine a fundamental theorem from graph theory: Whitney's 2-Isomorphism Theorem. Whitney's 2-Isomorphism theorem characterizes when two graphs have isomorphic cycle matroids.
Behavior Of Solutions For Bernoulli Initial-Value Problems,
2013
California State University, San Bernardino
Behavior Of Solutions For Bernoulli Initial-Value Problems, Carlos Marcelo Sardan
Theses Digitization Project
The purpose of this project is to investigate blow-up properties of solutions for specific initial-value problems that involve Bernoulli Ordinary Differential Equations (ODE's). The objective is to find conditions on the coefficients and on the initial-values that lead to unbounded growth of solutions in finite time.
Subset Non Associative Semirings,
2013
University of New Mexico
Subset Non Associative Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book for the first time we introduce the notion of subset non associative semirings. It is pertinent to keep on record that study of non associative semirings is meager and books on this specific topic is still rare. Authors have recently introduced the notion of subset algebraic structures. The maximum algebraic structure enjoyed by subsets with two binary operations is just a semifield and semiring, even if a ring or a field is used. In case semigroups or groups are used still the algebraic structure of the subset is only a semigroup. To construct a subset non associative …
Subset Groupoids,
2013
University of New Mexico
Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the new notion of constructing non associative algebraic structures using subsets of a groupoid. Thus subset groupoids are constructed using groupoids or loops. Even if we use subsets of loops still the algebraic structure we get with it is only a groupoid. However we can get a proper subset of it to be a subset loop which will be isomorphic with the loop which was used in the construction of the subset groupoid. To the best of the authors’ knowledge this is the first time non associative algebraic structures are constructed using subsets. We get …
Algebraic Structures Using [0,N),
2013
University of New Mexico
Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce a new method of building algebraic structures on the interval [0, n). This study is interesting and innovative. However, [0, n) is a semigroup under product, × modulo n and a semigroup under min or max operation. Further [0, n) is a group under addition modulo n. We see [0, n) under both max and min operation is a semiring. [0, n) under + and × is not in general a ring. We define S = {[0, n), +, ×} to be a pseudo special ring as the distributive law is …
Subset Semirings,
2013
University of New Mexico
Subset Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors study the new notion of the algebraic structure of the subset semirings using the subsets of rings or semirings. This study is innovative and interesting for the authors feel giving algebraic structure to collection of sets is not a new study, for when set theory was introduced such study was in vogue. But a systematic development of constructing algebraic structures using subsets of a set is absent, except for the set topology and in the construction of Boolean algebras. The authors have explored the study of constructing subset algebraic structures like semigroups, groupoids, semirings, non commutative …
Algebraic Structures Using Subsets,
2013
University of New Mexico
Algebraic Structures Using Subsets, Florentin Smarandache, W.B Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of subsets and giving algebraic structure to these subsets of a set started in the mid 18th century by George Boole. The first systematic presentation of Boolean algebra emerged in 1860s in papers written by William Jevons and Charles Sanders Peirce. Thus we see if P(X) denotes the collection of all subsets of the set X, then P(X) under the op erations of union and intersection is a Boolean algebra. Next the subsets of a set was used in the construction of topological spaces. We in this book consider subsets of a semigroup or a group or a …
Subset Polynomial Semirings And Subset Matrix Semirings,
2013
University of New Mexico
Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the notion of subset polynomial semirings and subset matrix semirings. The study of algebraic structures using subsets were recently carried out by the authors. Here we define the notion of subset row matrices, subset column matrices and subset m × n matrices. Study of this kind is developed in chapter two of this book. If we use subsets of a set X; say P(X), the power set of the set X....
Hence if P(X) is replaced by a group or a semigroup we get the subset matrix to be only a subset matrix semigroup. If …
Subset Interval Groupoids,
2013
University of New Mexico
Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of groupoids is meager and we have recently introduced the new notion of subset groupoids and have studied them. It is interesting to keep on record that interval groupoids have been studied by us in 2010. Further when the subsets of a loop are taken they also form only a subset groupoid and not a subset loop. Thus we do not have the concept of subset interval loop they only form a subset interval groupoid. Special elements like subset interval zero divisors, subset interval idempotents and subset interval units are studied. Concept of subset interval groupoid homomorphism is …
Subset Non Associative Topological Spaces,
2013
University of New Mexico
Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The concept of non associative topological space is new and innovative. In general topological spaces are defined as union and intersection of subsets of a set X. In this book authors for the first time define non associative topological spaces using subsets of groupoids or subsets of loops or subsets of groupoid rings or subsets of loop rings. This study leads to several interesting results in this direction.
Over hundred problems on non associative topological spaces using of subsets of loops or groupoids is suggested at the end of chapter two. Also conditions for these non associative subset topological spaces …
Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation,
2013
University of New Mexico
Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors bring out how sets in algebraic structure can be used to construct most generalized algebraic structures, like set linear algebra/vector space, set ideals in rings and semigroups. This sort of study is not only innovative but infact very helpful in cases instead of working with a large data we can work with a considerably small data. Thus instead of working with a vector space or a linear algebra V over a field F we can work with a subset in V and a needed subset in F, this can save both time and economy. The concept …
The Secant Conjecture In The Real Schubert Calculus,
2012
Sam Houston State University
The Secant Conjecture In The Real Schubert Calculus, Luis D. García-Puente, Nickolas Hein, Christopher Hillar, Abraham Martín Del Campo, James Ruffo, Frank Sottile, Zach Teitler
Mathematics Faculty Publications and Presentations
We formulate the Secant Conjecture, which is a generalization of the Shapiro Conjecture for Grassmannians. It asserts that an intersection of Schubert varieties in a Grassmannian is transverse with all points real if the flags defining the Schubert varieties are secant along disjoint intervals of a rational normal curve. We present theoretical evidence for this conjecture as well as computational evidence obtained in over one terahertz-year of computing, and we discuss some of the phenomena we observed in our data.
Weierstrass Points On Families Of Graphs,
2012
University of Connecticut
Weierstrass Points On Families Of Graphs, William D. Lindsay Jr.
Master's Theses
No abstract provided.
A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design,
2012
Prairie View A&M University
A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
A 4-point nonlinear corner-cutting subdivision scheme is established. It is induced from a special C-shaped biarc circular spline structure. The scheme is circular-invariant and can be effectively applied to 2-dimensional (2D) data sets that are locally convex. The scheme is also extended adaptively to non-convex data. Explicit examples are demonstrated.
Communal Partitions Of Integers,
2012
Gettysburg College
Communal Partitions Of Integers, Darren B. Glass
Math Faculty Publications
There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1/(k−1) of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in the case where they are ordered, unordered, or partially ordered. Finally, we discuss the application to algebraic geometry which motivated this question.
The Zeta Function Of Generalized Markoff Equations Over Finite Fields,
2012
University of Nevada, Las Vegas
The Zeta Function Of Generalized Markoff Equations Over Finite Fields, Juan Mariscal
UNLV Theses, Dissertations, Professional Papers, and Capstones
The purpose of this paper is to derive the Hasse-Weil zeta function of a special class of Algebraic varieties based on a generalization of the Markoff equation. We count the number of solutions to generalized Markoff equations over finite fields first by using the group structure of the set of automorphisms that generate solutions and in other cases by applying a slicing method from the two-dimensional cases. This enables us to derive a generating function for the number of solutions over the degree k extensions of a fixed finite field giving us the local zeta function. We then create an …
Elliptic Curves Of High Rank,
2012
Macalester College
Elliptic Curves Of High Rank, Cecylia Bocovich
Mathematics, Statistics, and Computer Science Honors Projects
The study of elliptic curves grows out of the study of elliptic functions which dates back to work done by mathematicians such as Weierstrass, Abel, and Jacobi. Elliptic curves continue to play a prominent role in mathematics today. An elliptic curve E is defined by the equation, y2 = x3 + ax + b, where a and b are coefficients that satisfy the property 4a3 + 27b2 = 0. The rational solutions of this curve form a group. This group, denoted E(Q), is known as the Mordell-Weil group and was proved by Mordell to be isomorphic …
