Current Search: mixed materials (x) » Department of Mathematical Sciences (x)
View All Items
Pages
- Title
- Algebraic and combinatorial aspects of group factorizations.
- Creator
- Bozovic, Vladimir., Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a set of new results regarding factorization of groups, with emphasis on the nonabelian case. We introduce a novel technique for factorization of groups, the so-called free mappings, a powerful tool for factorization of a wide class of abelian and non-abelian groups. By applying a certain group action on the blocks of a factorization, a number...
Show moreThe aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a set of new results regarding factorization of groups, with emphasis on the nonabelian case. We introduce a novel technique for factorization of groups, the so-called free mappings, a powerful tool for factorization of a wide class of abelian and non-abelian groups. By applying a certain group action on the blocks of a factorization, a number of combinatorial and computational problems were noted and studied. In particular, we analyze the case of the group Aut(Zn) acting on blocks of factorization of Zn. We present new theoretical facts that reveal the numerical structure of the stabilizer of a set in Zn, under the action of Aut(Zn). New algorithms for finding the stabilizer of a set and checking whether two sets belong to the same orbit are proposed.
Show less - Date Issued
- 2008
- PURL
- http://purl.flvc.org/FAU/107805
- Subject Headings
- Physical measurements, Mapping (Mathematics), Combinatorial enumeration problems, Algebra, Abstract
- Format
- Document (PDF)
- Title
- Computing topological dynamics from time series.
- Creator
- Wess, Mark., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The topological entropy of a continuous map quantifies the amount of chaos observed in the map. In this dissertation we present computational methods which enable us to compute topological entropy for given time series data generated from a continuous map with a transitive attractor. A triangulation is constructed in order to approximate the attractor and to construct a multivalued map that approximates the dynamics of the linear interpolant on the triangulation. The methods utilize...
Show moreThe topological entropy of a continuous map quantifies the amount of chaos observed in the map. In this dissertation we present computational methods which enable us to compute topological entropy for given time series data generated from a continuous map with a transitive attractor. A triangulation is constructed in order to approximate the attractor and to construct a multivalued map that approximates the dynamics of the linear interpolant on the triangulation. The methods utilize simplicial homology and in particular the Lefschetz Fixed Point Theorem to establish the existence of periodic orbits for the linear interpolant. A semiconjugacy is formed with a subshift of nite type for which the entropy can be calculated and provides a lower bound for the entropy of the linear interpolant. The dissertation concludes with a discussion of possible applications of this analysis to experimental time series.
Show less - Date Issued
- 2008
- PURL
- http://purl.flvc.org/FAU/186294
- Subject Headings
- Algebraic topology, Graph theory, Fixed point theory, Singularities (Mathematics)
- Format
- Document (PDF)
- Title
- On projected planes.
- Creator
- Caliskan, Cafer., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
This work was motivated by the well-known question: "Does there exist a nondesarguesian projective plane of prime order?" For a prime p 1, determine all subplanes of order p up to collineations, and check whether one of these is non-desarguesian." In this manuscript we use a group-theoretic methodology to determine the subplane structures of some non-desarguesian planes. In particular, we determine orbit representatives of all proper Q-subplanes both of a Veblen-Wedderburn (VW) plane of...
Show moreThis work was motivated by the well-known question: "Does there exist a nondesarguesian projective plane of prime order?" For a prime p < 11, there is only the pappian plane of order p. Hence, such planes are indeed desarguesian. Thus, it is of interest to examine whether there are non-desarguesian planes of order 11. A suggestion by Ascher Wagner in 1985 was made to Spyros S. Magliveras: "Begin with a non-desarguesian plane of order pk, k > 1, determine all subplanes of order p up to collineations, and check whether one of these is non-desarguesian." In this manuscript we use a group-theoretic methodology to determine the subplane structures of some non-desarguesian planes. In particular, we determine orbit representatives of all proper Q-subplanes both of a Veblen-Wedderburn (VW) plane of order 121 and of the Hughes plane of order 121, under their full collineation groups. In PI, there are 13 orbits of Baer subplanes, all of which are desarguesian, and approximately 3000 orbits of Fano subplanes. In Sigma , there are 8 orbits of Baer subplanes, all of which are desarguesian, 2 orbits of subplanes of order 3, and at most 408; 075 distinct Fano subplanes. In addition to the above results, we also study the subplane structures of some non-desarguesian planes, such as the Hall plane of order 25, the Hughes planes of order 25 and 49, and the Figueora planes of order 27 and 125. A surprising discovery by L. Puccio and M. J. de Resmini was the existence of a plane of order 3 in the Hughes plane of order 25. We generalize this result, showing that there are subplanes of order 3 in the Hughes planes of order q2, where q is a prime power and q 5 (mod 6). Furthermore, we analyze the structure of the full collineation groups of certain Veblen- Wedderburn (VW) planes of orders 25, 49 and 121, and discuss how to recover the planes from their collineation groups.
Show less - Date Issued
- 2010
- PURL
- http://purl.flvc.org/FAU/1927609
- Subject Headings
- Projected planes, Combinatorial designs and configurations, Surfaces, Algebraic, Manifolds (Mathematics)
- Format
- Document (PDF)
- Title
- Weakly integrally closed domains and forbidden patterns.
- Creator
- Hopkins, Mary E., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
An integral domain D is weakly integrally closed if whenever there is an element x in the quotient field of D and a nonzero finitely generated ideal J of D such that xJ J2, then x is in D. We define weakly integrally closed numerical monoids similarly. If a monoid algebra is weakly integrally closed, then so is the monoid. A pattern F of finitely many 0's and 1's is forbidden if whenever the characteristic binary string of a numerical monoid M contains F, then M is not weakly integrally...
Show moreAn integral domain D is weakly integrally closed if whenever there is an element x in the quotient field of D and a nonzero finitely generated ideal J of D such that xJ J2, then x is in D. We define weakly integrally closed numerical monoids similarly. If a monoid algebra is weakly integrally closed, then so is the monoid. A pattern F of finitely many 0's and 1's is forbidden if whenever the characteristic binary string of a numerical monoid M contains F, then M is not weakly integrally closed. Any stretch of the pattern 11011 is forbidden. A numerical monoid M is weakly integrally closed if and only if it has a forbidden pattern. For every finite set S of forbidden patterns, there exists a monoid that is not weakly integrally closed and that contains no stretch of a pattern in S. It is shown that particular monoid algebras are weakly integrally closed.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/199327
- Subject Headings
- Mathematical analysis, Algebra, Homological, Monoids, Categories (Mathematics), Semigroup algebras
- Format
- Document (PDF)
- Title
- Minimal zero-dimensional extensions.
- Creator
- Chiorescu, Marcela, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The structure of minimal zero-dimensional extension of rings with Noetherian spectrum in which zero is a primary ideal and with at most one prime ideal of height greater than one is determined. These rings include K[[X,T]] where K is a field and Dedenkind domains, but need not be Noetherian nor integrally closed. We show that for such a ring R there is a one-to-one correspondence between isomorphism classes of minimal zero-dimensional extensions of R and sets M, where the elements of M are...
Show moreThe structure of minimal zero-dimensional extension of rings with Noetherian spectrum in which zero is a primary ideal and with at most one prime ideal of height greater than one is determined. These rings include K[[X,T]] where K is a field and Dedenkind domains, but need not be Noetherian nor integrally closed. We show that for such a ring R there is a one-to-one correspondence between isomorphism classes of minimal zero-dimensional extensions of R and sets M, where the elements of M are ideals of R primary for distinct prime ideals of height greater than zero. A subsidiary result is the classification of minimal zero-dimensional extensions of general ZPI-rings.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/210447
- Subject Headings
- Algebra, Abstract, Noetherian rings, Commutative rings, Modules (Algebra), Algebraic number theory
- Format
- Document (PDF)
- Title
- Auslander-Reiten theory for systems of submodule embeddings.
- Creator
- Moore, Audrey., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
In this dissertation, we will investigate aspects of Auslander-Reiten theory adapted to the setting of systems of submodule embeddings. Using this theory, we can compute Auslander-Reiten quivers of such categories, which among other information, yields valuable information about the indecomposable objects in such a category. A main result of the dissertation is an adaptation to this situation of the Auslander and Ringel-Tachikawa Theorem which states that for an artinian ring R of finite...
Show moreIn this dissertation, we will investigate aspects of Auslander-Reiten theory adapted to the setting of systems of submodule embeddings. Using this theory, we can compute Auslander-Reiten quivers of such categories, which among other information, yields valuable information about the indecomposable objects in such a category. A main result of the dissertation is an adaptation to this situation of the Auslander and Ringel-Tachikawa Theorem which states that for an artinian ring R of finite representation type, each R-module is a direct sum of finite-length indecomposable R-modules. In cases where this applies, the indecomposable objects obtained in the Auslander-Reiten quiver give the building blocks for the objects in the category. We also briefly discuss in which cases systems of submodule embeddings form a Frobenius category, and for a few examples explore pointwise Calabi-Yau dimension of such a category.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/fcla/dt/210496
- Subject Headings
- Artin algebras, Rings (Algebra), Representation of algebras, Embeddings (Mathematics), Linear algebraic groups
- Format
- Document (PDF)
- Title
- Signature schemes in single and multi-user settings.
- Creator
- Villanyi, Viktoria., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
In the first chapters we will give a short introduction to signature schemes in single and multi-user settings. We give the definition of a signature scheme and explain a group of possible attacks on them. In Chapter 6 we give a construction which derives a subliminal-free RSA public key. In the construction we use a computationally binding and unconditionally hiding commitment scheme. To establish a subliminal-free RSA modulus n, we have to construct the secret primes p and q. To prove p and...
Show moreIn the first chapters we will give a short introduction to signature schemes in single and multi-user settings. We give the definition of a signature scheme and explain a group of possible attacks on them. In Chapter 6 we give a construction which derives a subliminal-free RSA public key. In the construction we use a computationally binding and unconditionally hiding commitment scheme. To establish a subliminal-free RSA modulus n, we have to construct the secret primes p and q. To prove p and q are primes we use Lehmann's primality test on the commitments. The chapter is based on the paper, "RSA signature schemes with subliminal-free public key" (Tatra Mountains Mathematical Publications 41 (2008)). In chapter 7 a one-time signature scheme using run-length encoding is presented, which in the random oracle model offers security against chosen-message attacks. For parameters of interest, the proposed scheme enables about 33% faster verification with a comparable signature size than a construction of Merkle and Winternitz. The public key size remains unchanged (1 hash value). The main cost for the faster verification is an increase in the time required for signing messages and for key generation. The chapter is based on the paper "A one-time signature using run-length encoding" (Information Processing Letters Vol. 108, Issue 4, (2008)).
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/215289
- Subject Headings
- Information technology, Security measures, Cryptography, Coding theory, Data encryption (Computer science), DIgital watermarking
- Format
- Document (PDF)
- Title
- Polynomials that are integer valued on the image of an integer-valued polynomial.
- Creator
- Marshall, Mario V., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
Let D be an integral domain and f a polynomial that is integer-valued on D. We prove that Int(f(D);D) has the Skolem Property and give a description of its spectrum. For certain discrete valuation domains we give a basis for the ring of integer-valued even polynomials. For these discrete valuation domains, we also give a series expansion of continuous integer-valued functions.
- Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/216411
- Subject Headings
- Polynomials, Ring of integers, Ideals (Algebra)
- Format
- Document (PDF)
- Title
- Cryptography in the presence of key-dependent messages.
- Creator
- Gonzalez, Madeline., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The aim of this work is to investigate a security model in which we allow an adversary to have access to functions of the secret key. In recent years, significant progress has been made in understanding the security of encryption schemes in the presence of key-dependent plaintexts or messages (known as KDM). Here, we motivate and explore the security of a setting, where an adversary against a message authentication code (MAC) or signature scheme can access signatures on key-dependent messages...
Show moreThe aim of this work is to investigate a security model in which we allow an adversary to have access to functions of the secret key. In recent years, significant progress has been made in understanding the security of encryption schemes in the presence of key-dependent plaintexts or messages (known as KDM). Here, we motivate and explore the security of a setting, where an adversary against a message authentication code (MAC) or signature scheme can access signatures on key-dependent messages. We propose a way to formalize the security of message authentication schemes in the presence of key-dependent MACs (KD-EUF) and of signature schemes in the presence of key-dependent signatures (KDS). An attack on a message recognition protocol involving a MAC is presented. It turns out that the situation is quite different from key-dependent encryption: To achieve KD-EUF-security or KDS-security under non-adaptive chosen message attacks, the use of a stateful signing algorithm is inevitable even in the random oracle model. After discussing the connection between key-dependent signing and forward security, we describe a compiler which lifts any EUF-CMA secure one-time signature scheme to a forward secure signature scheme offering KDS-CMA security. Then, we discuss how aggregate signatures can be used to combine the signatures in the certificate chain used in the compiler. A natural question arises about how to combine the security definitions of KDM and KDS to come up with a signcryption scheme that is secure. We also offer a connection with Leakage-Resilient Signatures, which take into account side-channel attacks. Lastly, we present some open problems for future research.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/2182087
- Subject Headings
- Cryptography, Data processing, Digital signatures, Computer security, Data encryption (Computer science), Software protection
- Format
- Document (PDF)
- Title
- Unique decomposition of direct sums of ideals.
- Creator
- Ay, Basak., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
We say that a commutative ring R has the unique decomposition into ideals (UDI) property if, for any R-module which decomposes into a finite direct sum of indecomposable ideals, this decomposition is unique up to the order and isomorphism class of the ideals. In a 2001 paper, Goeters and Olberding characterize the UDI property for Noetherian integral domains. In Chapters 1-3 the UDI property for reduced Noetherian rings is characterized. In Chapter 4 it is shown that overrings of one...
Show moreWe say that a commutative ring R has the unique decomposition into ideals (UDI) property if, for any R-module which decomposes into a finite direct sum of indecomposable ideals, this decomposition is unique up to the order and isomorphism class of the ideals. In a 2001 paper, Goeters and Olberding characterize the UDI property for Noetherian integral domains. In Chapters 1-3 the UDI property for reduced Noetherian rings is characterized. In Chapter 4 it is shown that overrings of one-dimensional reduced commutative Noetherian rings with the UDI property have the UDI property, also. In Chapter 5 we show that the UDI property implies the Krull-Schmidt property for direct sums of torsion-free rank one modules for a reduced local commutative Noetherian one-dimensional ring R.
Show less - Date Issued
- 2010
- PURL
- http://purl.flvc.org/FAU/2683133
- Subject Headings
- Algebraic number theory, Modules (Algebra), Noetherian rings, Commutative rings, Algebra, Abstract
- Format
- Document (PDF)
- Title
- Higher order commutators in the method of orbits.
- Creator
- Kasprikova, Eva., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
Benson spaces of higher order are introduced extending the idea of N. Krugljak and M. Milman, A distance between orbits that controls commutator estimates and invertibilty of operators, Advances in Mathematics 182 (2004), 78-123. The concept of Benson shift operators is introduced and a class of spaces equipped with these operators is considered. Commutator theorems of higher order on orbit spaces generated by a single element are proved for this class. It is shown that these results apply to...
Show moreBenson spaces of higher order are introduced extending the idea of N. Krugljak and M. Milman, A distance between orbits that controls commutator estimates and invertibilty of operators, Advances in Mathematics 182 (2004), 78-123. The concept of Benson shift operators is introduced and a class of spaces equipped with these operators is considered. Commutator theorems of higher order on orbit spaces generated by a single element are proved for this class. It is shown that these results apply to the complex method of interpolation and to the real method of interpolation for the case q=1. Two new characterizations are presented of the domain space of the "derivation" operator in the context of orbital methods. Comparisons to the work of others are made, especially the unifying paper of M. Cwikel, N. Kalton, M. Milman and R. Rochberg, A United Theory of Commutator Estimates for a Class of Interpolation Methods, Advances in Mathematics 169 2002, 241-312.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/2684304
- Subject Headings
- Operator theory, Interpolation spaces, Finite groups, Sporadic groups (Mathematics)
- Format
- Document (PDF)
- Title
- Message authentication in an identity-based encryption scheme: 1-Key-Encrypt-Then-MAC.
- Creator
- Amento, Brittanney Jaclyn, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
We present an Identity-Based Encryption scheme, 1-Key-Encrypt-Then-MAC, in which we are able to verify the authenticity of messages using a MAC. We accomplish this authentication by combining an Identity-Based Encryption scheme given by Boneh and Franklin, with an Identity-Based Non-Interactive Key Distribution given by Paterson and Srinivasan, and attaching a MAC. We prove the scheme is chosen plaintext secure and chosen ciphertext secure, and the MAC is existentially unforgeable.
- Date Issued
- 2010
- PURL
- http://purl.flvc.org/FAU/2796050
- Subject Headings
- Data encryption (Computer science), Public key cryptopgraphy, Public key infrastructure (Computer security)
- Format
- Document (PDF)
- Title
- An algebraic attack on block ciphers.
- Creator
- Matheis, Kenneth., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The aim of this work is to investigate an algebraic attack on block ciphers called Multiple Right Hand Sides (MRHS). MRHS models a block cipher as a system of n matrix equations Si := Aix = [Li], where each Li can be expressed as a set of its columns bi1, . . . , bisi . The set of solutions Ti of Si is dened as the union of the solutions of Aix = bij , and the set of solutions of the system S1, . . . , Sn is dened as the intersection of T1, . . . , Tn. Our main contribution is a hardware...
Show moreThe aim of this work is to investigate an algebraic attack on block ciphers called Multiple Right Hand Sides (MRHS). MRHS models a block cipher as a system of n matrix equations Si := Aix = [Li], where each Li can be expressed as a set of its columns bi1, . . . , bisi . The set of solutions Ti of Si is dened as the union of the solutions of Aix = bij , and the set of solutions of the system S1, . . . , Sn is dened as the intersection of T1, . . . , Tn. Our main contribution is a hardware platform which implements a particular algorithm that solves MRHS systems (and hence block ciphers). The case is made that the platform performs several thousand orders of magnitude faster than software, it costs less than US$1,000,000, and that actual times of block cipher breakage can be calculated once it is known how the corresponding software behaves. Options in MRHS are also explored with a view to increase its efficiency.
Show less - Date Issued
- 2010
- PURL
- http://purl.flvc.org/FAU/2976444
- Subject Headings
- Ciphers, Cryptography, Data encryption (Computer science), Computer security, Coding theory, Integrated circuits, Design and construction
- Format
- Document (PDF)
- Title
- The existence of minimal logarithmic signatures for classical groups.
- Creator
- Singhi, Nikhil., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
A logarithmic signature (LS) for a nite group G is an ordered tuple = [A1;A2; : : : ;An] of subsets Ai of G, such that every element g 2 G can be expressed uniquely as a product g = a1a2 : : : ; an, where ai 2 Ai. Logarithmic signatures were dened by Magliveras in the late 1970's for arbitrary nite groups in the context of cryptography. They were also studied for abelian groups by Hajos in the 1930's. The length of an LS is defined to be `() = Pn i=1 jAij. It can be easily seen that for a...
Show moreA logarithmic signature (LS) for a nite group G is an ordered tuple = [A1;A2; : : : ;An] of subsets Ai of G, such that every element g 2 G can be expressed uniquely as a product g = a1a2 : : : ; an, where ai 2 Ai. Logarithmic signatures were dened by Magliveras in the late 1970's for arbitrary nite groups in the context of cryptography. They were also studied for abelian groups by Hajos in the 1930's. The length of an LS is defined to be `() = Pn i=1 jAij. It can be easily seen that for a group G of order Qk j=1 pj mj , the length of any LS for G satises `() Pk j=1mjpj . An LS for which this lower bound is achieved is called a minimal logarithmic signature (MLS). The MLS conjecture states that every finite simple group has an MLS. If the conjecture is true then every finite group will have an MLS. The conjecture was shown to be true by a number of researchers for a few classes of finite simple groups. However, the problem is still wide open. This dissertation addresses the MLS conjecture for the classical simple groups. In particular, it is shown that MLS's exist for the symplectic groups Sp2n(q), the orthogonal groups O 2n(q0) and the corresponding simple groups PSp2n(q) and 2n(q0) for all n 2 N, prime power q and even prime power q0. The existence of an MLS is also shown for all unitary groups GUn(q) for all odd n and q = 2s under the assumption that an MLS exists for GUn 1(q). The methods used are very general and algorithmic in nature and may be useful for studying all nite simple groups of Lie type and possibly also the sporadic groups. The blocks of logarithmic signatures constructed in this dissertation have cyclic structure and provide a sort of cyclic decomposition for these classical groups.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3172943
- Subject Headings
- Finite groups, Abelian groups, Number theory, Combinatorial group theory, Mathematical recreations, Linear algebraic groups, Lie groups
- Format
- Document (PDF)
- Title
- On the minimal logarithmic signature conjecture.
- Creator
- Singhi, Nidhi., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The minimal logarithmic signature conjecture states that in any finite simple group there are subsets Ai, 1 i s such that the size jAij of each Ai is a prime or 4 and each element of the group has a unique expression as a product Qs i=1 ai of elements ai 2 Ai. Logarithmic signatures have been used in the construction of several cryptographic primitives since the late 1970's [3, 15, 17, 19, 16]. The conjecture is shown to be true for various families of simple groups including cyclic groups,...
Show moreThe minimal logarithmic signature conjecture states that in any finite simple group there are subsets Ai, 1 i s such that the size jAij of each Ai is a prime or 4 and each element of the group has a unique expression as a product Qs i=1 ai of elements ai 2 Ai. Logarithmic signatures have been used in the construction of several cryptographic primitives since the late 1970's [3, 15, 17, 19, 16]. The conjecture is shown to be true for various families of simple groups including cyclic groups, An, PSLn(q) when gcd(n; q 1) is 1, 4 or a prime and several sporadic groups [10, 9, 12, 14, 18]. This dissertation is devoted to proving that the conjecture is true for a large class of simple groups of Lie type called classical groups. The methods developed use the structure of these groups as isometry groups of bilinear or quadratic forms. A large part of the construction is also based on the Bruhat and Levi decompositions of parabolic subgroups of these groups. In this dissertation the conjecture is shown to be true for the following families of simple groups: the projective special linear groups PSLn(q), the projective symplectic groups PSp2n(q) for all n and q a prime power, and the projective orthogonal groups of positive type + 2n(q) for all n and q an even prime power. During the process, the existence of minimal logarithmic signatures (MLS's) is also proven for the linear groups: GLn(q), PGLn(q), SLn(q), the symplectic groups: Sp2n(q) for all n and q a prime power, and for the orthogonal groups of plus type O+ 2n(q) for all n and q an even prime power. The constructions in most of these cases provide cyclic MLS's. Using the relationship between nite groups of Lie type and groups with a split BN-pair, it is also shown that every nite group of Lie type can be expressed as a disjoint union of sets, each of which has an MLS.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3172946
- Subject Headings
- Finite groups, Abelian groups, Number theory, Combinatorial group theory, Mathematical recreations, Linear algebraic groups, Lie groups
- Format
- Document (PDF)
- Title
- Multivariate finite operator calculus applied to counting ballot paths containing patterns [electronic resource].
- Creator
- Sullivan, Shaun, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
Counting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length, but the characteristics of the pattern are responsible for the difficulties in finding explicit solutions. Certain features, like overlap and difference in number of ! and " steps determine the recursion formula. In the case of ballot paths, that is paths the stay weakly above the line y = x, the solutions to the recursions are typically polynomial...
Show moreCounting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length, but the characteristics of the pattern are responsible for the difficulties in finding explicit solutions. Certain features, like overlap and difference in number of ! and " steps determine the recursion formula. In the case of ballot paths, that is paths the stay weakly above the line y = x, the solutions to the recursions are typically polynomial sequences. The objects of Finite Operator Calculus are polynomial sequences, thus the theory can be used to solve the recursions. The theory of Finite Operator Calculus is strengthened and extended to the multivariate setting in order to obtain solutions, and to prepare for future applications.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3174076
- Subject Headings
- Combinatorial probabilities, Lattice paths, Combinatorial enumeration problems, Generating functions
- Format
- Document (PDF)
- Title
- Stochastic optimal impulse control of jump diffusions with application to exchange rate.
- Creator
- Perera, Sandun C., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
We generalize the theory of stochastic impulse control of jump diffusions introduced by Oksendal and Sulem (2004) with milder assumptions. In particular, we assume that the original process is affected by the interventions. We also generalize the optimal central bank intervention problem including market reaction introduced by Moreno (2007), allowing the exchange rate dynamic to follow a jump diffusion process. We furthermore generalize the approximation theory of stochastic impulse control...
Show moreWe generalize the theory of stochastic impulse control of jump diffusions introduced by Oksendal and Sulem (2004) with milder assumptions. In particular, we assume that the original process is affected by the interventions. We also generalize the optimal central bank intervention problem including market reaction introduced by Moreno (2007), allowing the exchange rate dynamic to follow a jump diffusion process. We furthermore generalize the approximation theory of stochastic impulse control problems by a sequence of iterated optimal stopping problems which is also introduced in Oksendal and Sulem (2004). We develop new results which allow us to reduce a given impulse control problem to a sequence of iterated optimal stopping problems even though the original process is affected by interventions.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/3174308
- Subject Headings
- Management, Mathematical models, Control theory, Stochastic differential equations, Distribution (Probability theory), Optimal stopping (Mathematical statistics), Economics, Mathematical
- Format
- Document (PDF)
- Title
- The enumeration of lattice paths and walks.
- Creator
- Gao, Shanzhen., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
A well-known long standing problem in combinatorics and statistical mechanics is to find the generating function for self-avoiding walks (SAW) on a two-dimensional lattice, enumerated by perimeter. A SAW is a sequence of moves on a square lattice which does not visit the same point more than once. It has been considered by more than one hundred researchers in the pass one hundred years, including George Polya, Tony Guttmann, Laszlo Lovasz, Donald Knuth, Richard Stanley, Doron Zeilberger,...
Show moreA well-known long standing problem in combinatorics and statistical mechanics is to find the generating function for self-avoiding walks (SAW) on a two-dimensional lattice, enumerated by perimeter. A SAW is a sequence of moves on a square lattice which does not visit the same point more than once. It has been considered by more than one hundred researchers in the pass one hundred years, including George Polya, Tony Guttmann, Laszlo Lovasz, Donald Knuth, Richard Stanley, Doron Zeilberger, Mireille Bousquet-Mlou, Thomas Prellberg, Neal Madras, Gordon Slade, Agnes Dit- tel, E.J. Janse van Rensburg, Harry Kesten, Stuart G. Whittington, Lincoln Chayes, Iwan Jensen, Arthur T. Benjamin, and many others. More than three hundred papers and a few volumes of books were published in this area. A SAW is interesting for simulations because its properties cannot be calculated analytically. Calculating the number of self-avoiding walks is a common computational problem. A recently proposed model called prudent self-avoiding walks (PSAW) was first introduced to the mathematics community in an unpublished manuscript of Pra, who called them exterior walks. A prudent walk is a connected path on square lattice such that, at each step, the extension of that step along its current trajectory will never intersect any previously occupied vertex. A lattice path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. We will discuss some enumerative problems in self-avoiding walks, lattice paths and walks with several step vectors. Many open problems are posted.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3183129
- Subject Headings
- Combinatorial analysis, Approximation theory, Mathematical statistics, Limit theorems (Probabilty theory)
- Format
- Document (PDF)
- Title
- Derivation of planar diffeomorphisms from Hamiltonians with a kick.
- Creator
- Barney, Zalmond C., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
In this thesis we will discuss connections between Hamiltonian systems with a periodic kick and planar diffeomorphisms. After a brief overview of Hamiltonian theory we will focus, as an example, on derivations of the Hâenon map that can be obtained by considering kicked Hamiltonian systems. We will conclude with examples of Hâenon maps of interest.
- Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3329833
- Subject Headings
- Mathematical physics, Differential equations, Partial, Hamiltonian systems, Algebra, Linear, Chaotic behavior in systems
- Format
- Document (PDF)
- Title
- Empirical likelihood method for segmented linear regression.
- Creator
- Liu, Zhihua., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
For a segmented regression system with an unknown change-point over two domains of a predictor, a new empirical likelihood ratio test statistic is proposed to test the null hypothesis of no change. The proposed method is a non-parametric method which releases the assumption of the error distribution. Under the null hypothesis of no change, the proposed test statistic is shown empirically Gumbel distributed with robust location and scale parameters under various parameter settings and error...
Show moreFor a segmented regression system with an unknown change-point over two domains of a predictor, a new empirical likelihood ratio test statistic is proposed to test the null hypothesis of no change. The proposed method is a non-parametric method which releases the assumption of the error distribution. Under the null hypothesis of no change, the proposed test statistic is shown empirically Gumbel distributed with robust location and scale parameters under various parameter settings and error distributions. Under the alternative hypothesis with a change-point, the comparisons with two other methods (Chen's SIC method and Muggeo's SEG method) show that the proposed method performs better when the slope change is small. A power analysis is conducted to illustrate the performance of the test. The proposed method is also applied to analyze two real datasets: the plasma osmolality dataset and the gasoline price dataset.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3332719
- Subject Headings
- Change-point problems, Regression analysis, Econometrics, Limit theory (Probability theory)
- Format
- Document (PDF)