Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Algebra (57)
- Applied Mathematics (35)
- Discrete Mathematics and Combinatorics (29)
- Geometry and Topology (23)
- Computer Sciences (16)
-
- Number Theory (14)
- Theory and Algorithms (11)
- Algebraic Geometry (9)
- Partial Differential Equations (8)
- Information Security (6)
- Numerical Analysis and Computation (6)
- Statistics and Probability (6)
- Dynamical Systems (5)
- Analysis (4)
- Analytical, Diagnostic and Therapeutic Techniques and Equipment (4)
- Medicine and Health Sciences (4)
- Life Sciences (3)
- Genetics and Genomics (2)
- Physics (2)
- Probability (2)
- Quantum Physics (2)
- Statistical Methodology (2)
- Art and Design (1)
- Arts and Humanities (1)
- Biochemistry, Biophysics, and Structural Biology (1)
- Clinical Trials (1)
- Computational Biology (1)
- Dynamic Systems (1)
- Keyword
-
- Hyperbolic geometry (9)
- Cryptography (8)
- Group Theory (8)
- Discrete logarithm (7)
- Tiling (7)
-
- Tilings (7)
- Cwatsets (5)
- Cwatset (4)
- Discrete Logarithm (4)
- Inverse problems (4)
- Rewriteability in finite groups (4)
- Finite Group Theory (3)
- Functional graphs (3)
- Rewriteability (3)
- Riemann surface (3)
- Tesselation (3)
- 3-rewriteability (2)
- Automorphism Group (2)
- Automorphism group (2)
- Branched cover (2)
- Cellular automata (2)
- Computation (2)
- Conjugacy Classes (2)
- Cyclicizer (2)
- Elliptic curve (2)
- Hamiltonian groups (2)
- Heat Equation (2)
- Hensel's lemma (2)
- Kaleidoscopic (2)
- Kaleidoscopic quadrilateral (2)
Articles 1 - 30 of 134
Full-Text Articles in Mathematics
Reversibility Of Stranded Cellular Automata, Allyn Loyd
Reversibility Of Stranded Cellular Automata, Allyn Loyd
Mathematical Sciences Technical Reports (MSTR)
Cellular automata, such as the Stranded Cellular Automaton (SCA) model created by Joshua and Lana Holden, can be used to model weaving patterns. Similar models can be constructed to model macrame patterns, where strands are knotted together. If a rule is injective, then it is reversible. If a rule is surjective, then every configuration has at least one predecessor. In this paper, we will discuss the injectivity and surjectivity of several new SCA models in order to find reversible rules. We will also analyze the number of configurations with no predecessors and the number of configurations that map to the …
Applying Hallgren’S Algorithm For Solving Pell’S Equation To Finding The Irrational Slope Of The Launch Of A Billiard Ball, Sangheon Choi
Applying Hallgren’S Algorithm For Solving Pell’S Equation To Finding The Irrational Slope Of The Launch Of A Billiard Ball, Sangheon Choi
Mathematical Sciences Technical Reports (MSTR)
This thesis is an exploration of Quantum Computing applied to Pell’s equation in an attempt to find solutions to the Billiard Ball Problem. Pell’s equation is a Diophantine equation in the form of x2 − ny2 = 1, where n is a given positive nonsquare integer, and integer solutions are sought for x and y. We will be applying Hallgren’s algorithm for finding irrational periods in functions, in the context of billiard balls and their movement on a friction-less unit square billiard table. Our central research question has been the following: Given the cutting sequence of the billiard …
Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng
Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng
Mathematical Sciences Technical Reports (MSTR)
In 2012, Guedes, Assis, and Lula proposed a quantum attack on a pseudorandom number generator named the Blum-Micali Pseudorandom number generator. They claimed that the quantum attack can outperform classical attacks super-polynomially. However, this paper shows that the quantum attack cannot get the correct seed and provides another corrected algorithm that is in exponential time but still faster than the classical attack. Since the original classical attacks are in exponential time, the Blum-Micali pseudorandom number generator would be still quantum resistant.
The Primitive Root Problem: A Problem In Bqp, Shixin Wu
The Primitive Root Problem: A Problem In Bqp, Shixin Wu
Mathematical Sciences Technical Reports (MSTR)
Shor’s algorithm proves that the discrete logarithm problem is in BQP. Based on his algorithm, we prove that the primitive root problem, a problem that verifies if some integer g is a primitive root modulo p where p is the largest prime number smaller than 2n for a given n, which is assumed to be harder than the discrete logarithm problem, is in BQP by using an oracle quantum Turing machine.
Structure Of Number Theoretic Graphs, Lee Trent
Structure Of Number Theoretic Graphs, Lee Trent
Mathematical Sciences Technical Reports (MSTR)
The tools of graph theory can be used to investigate the structure
imposed on the integers by various relations. Here we investigate two
kinds of graphs. The first, a square product graph, takes for its vertices
the integers 1 through n, and draws edges between numbers whose product
is a square. The second, a square product graph, has the same vertex set,
and draws edges between numbers whose sum is a square.
We investigate the structure of these graphs. For square product
graphs, we provide a rather complete characterization of their structure as
a union of disjoint complete graphs. For …
Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu
Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu
Mathematical Sciences Technical Reports (MSTR)
Molina and Watrous present a variation of the method to simulate a quantum Turing machine employed in Yao’s 1995 publication “Quantum Circuit Complexity”. We use a computer program to implement their method with linear algebra and an additional unitary operator defined to complete the details. Their method is verified to be correct on a quantum Turing machine.
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Mathematical Sciences Technical Reports (MSTR)
Hash functions map data of arbitrary length to data of predetermined length. Good hash functions are hard to predict, making them useful in cryptography. We are interested in the elliptic curve CGL hash function, which maps a bitstring to an elliptic curve by traversing an inputdetermined path through an isogeny graph. The nodes of an isogeny graph are elliptic curves, and the edges are special maps betwixt elliptic curves called isogenies. Knowing which hash values are most likely informs us of potential security weaknesses in the hash function. We use stochastic matrices to compute the expected probability distributions of the …
Compare And Contrast Maximum Likelihood Method And Inverse Probability Weighting Method In Missing Data Analysis, Scott Sun
Mathematical Sciences Technical Reports (MSTR)
Data can be lost for different reasons, but sometimes the missingness is a part of the data collection process. Unbiased and efficient estimation of the parameters governing the response mean model requires the missing data to be appropriately addressed. This paper compares and contrasts the Maximum Likelihood and Inverse Probability Weighting estimators in an Outcome-Dependendent Sampling design that deliberately generates incomplete observations. WE demonstrate the comparison through numerical simulations under varied conditions: different coefficient of determination, and whether or not the mean model is misspecified.
Topological And H^Q Equivalence Of Cyclic N-Gonal Actions On Riemann Surfaces - Part Ii, Sean A. Broughton
Topological And H^Q Equivalence Of Cyclic N-Gonal Actions On Riemann Surfaces - Part Ii, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
We consider conformal actions of the finite group G on a closed Riemann surface S, as well as algebraic actions of G on smooth, complete, algebraic curves over an arbitrary, algebraically closed field. There are several notions of equivalence of actions, the most studied of which is topological equivalence, because of its close relationship to the branch locus of moduli space. A second important equivalence relation is that induced by representation of G on spaces of holomorphic q-differentials. The notion of topological equivalence does not work well in positive characteristic. We shall discuss an alternative to topological equivalence, …
Modeling Braids With Space-Varying And Time-Varying Stranded Cellular Automata, Brian Chan
Modeling Braids With Space-Varying And Time-Varying Stranded Cellular Automata, Brian Chan
Mathematical Sciences Technical Reports (MSTR)
Braids in a traditional sense and braids in a mathematical sense are wildly different outlooks on the same concept. Using cellular automata to represent and analyze braids is a way to bridge the gap between them. Joshua and Lana Holden and Hao Yang have previously worked on developing and expanding upon a Stranded Cellular Automata (SCA) model capable of representing many different braids and weaves. Continuing their work, we were able to devise a more user-friendly method for interacting with the model such that even those without a mathematical background can construct and analyze braids of their own. This paper …
The Game Of Life On The Hyperbolic Plane, Yuncong Gu
The Game Of Life On The Hyperbolic Plane, Yuncong Gu
Mathematical Sciences Technical Reports (MSTR)
In this paper, we work on the Game of Life on the hyperbolic plane. We are interested in different tessellations on the hyperbolic plane and different Game of Life rules. First, we show the exponential growth of polygons on the pentagon tessellation. Moreover, we find that the Group of 3 can keep the boundary of a set not getting smaller. We generalize the existence of still lifes by computer simulations. Also, we will prove some propositions of still lifes and cycles. There exists a still life under rules B1, B2, and S3.
Repeat Length Of Patterns On Weaving Products, Zhuochen Liu
Repeat Length Of Patterns On Weaving Products, Zhuochen Liu
Mathematical Sciences Technical Reports (MSTR)
Interlacing strands have been used to create artistic weaving patterns. Repeated patterns form aesthetically pleasing products. This research is a mathematical modeling of weaving products in the real world by using Cellular Automata. The research is conducted by observing the evolution of the model to better understand products in the real world. Specifically, this research focuses on the repeat length of a weaving pattern given the rule of generating it and the configuration of the starting row. Previous studies have shown the range of the repeat length in specific situations. This paper will generalize the precise repeat length in one …
Forward Selection Via Distance Correlation, Ty Adams
Forward Selection Via Distance Correlation, Ty Adams
Mathematical Sciences Technical Reports (MSTR)
No abstract provided.
Periodicity And Invertibility Of Lattice Gas Cellular Automata, Jiawen Wang
Periodicity And Invertibility Of Lattice Gas Cellular Automata, Jiawen Wang
Mathematical Sciences Technical Reports (MSTR)
A cellular automaton is a type of mathematical system that models the behavior of a set of cells with discrete values in progressing time steps. The often complicated behaviors of cellular automata are studied in computer science, mathematics, biology, and other science related fields. Lattice gas cellular automata are used to simulate the movements of particles. This thesis aims to discuss the properties of lattice gas models, including periodicity and invertibility, and to examine their accuracy in reflecting the physics of particles in real life. Analysis of elementary cellular automata is presented to introduce the concept of cellular automata and …
Effects Of Framing In Exams On Student Performance, Mariana Lane, Eric Reyes
Effects Of Framing In Exams On Student Performance, Mariana Lane, Eric Reyes
Mathematical Sciences Technical Reports (MSTR)
No abstract provided.
Stranded Cellular Automaton And Weaving Products, Hao Yang
Stranded Cellular Automaton And Weaving Products, Hao Yang
Mathematical Sciences Technical Reports (MSTR)
In order to analyze weaving products mathematically and find out valid weaving products, it is natural to relate them to Cellular Automaton. They are both generated based on specific rules and some initial conditions. Holden and Holden have created a Stranded Cellular Automaton that can represent common weaving and braiding products. Based on their previous findings, we were able to construct a Java program and analyze various aspects of the automaton they created. This paper will discuss the complexity of the Stranded Cellular Automaton, how to determine whether a weaving product holds together or not based on the automaton and …
Branching Matrices For The Automorphism Group Lattice Of A Riemann Surface, Sean A. Broughton
Branching Matrices For The Automorphism Group Lattice Of A Riemann Surface, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
Let S be a Riemann surface and G a large subgroup of Aut(S) (Aut(S) may be unknown). We are particularly interested in regular n-gonal surfaces, i.e., the quotient surface S/G (and hence S/Aut(S)) has genus zero. For various H the ramification information of the branched coverings S/K -> S/H may be captured in a matrix. The ramification information, in particular strong branching, may be then be used in analyzing the structure of Aut(S). The ramification information is conjugation invariant so the matrix's rows and columns may be indexed by conjugacy classes of subgroups. The only required …
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Mathematical Sciences Technical Reports (MSTR)
The problem of exact polynomial factorization, in other words expressing a polynomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used …
Inverse Laplace Transform And Post Inversion Formula, Qinmao Zhang
Inverse Laplace Transform And Post Inversion Formula, Qinmao Zhang
Mathematical Sciences Technical Reports (MSTR)
This paper is dedicated to a general numerical approach to inverse Laplace transforms based on the Post Inversion Formula, which is a theoretical equivalent to the inverse Laplace transform. Though most approaches are too computationally intensive to be of practical use, we introduce an efficient algorithm to compute it based on the Parker-Sochacki method (PSM). This paper also contains some example MATLAB code and algorithm analysis.
Topological And Hq Equivalence Of Prime Cyclic P-Gonal Actions On Riemann Surfaces (Corrected), Sean A. Broughton
Topological And Hq Equivalence Of Prime Cyclic P-Gonal Actions On Riemann Surfaces (Corrected), Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
Two Riemann surfaces S1 and S2 with conformal G-actions have topologically equivalent actions if there is a homeomorphism h : S1 -> S2 which intertwines the actions. A weaker equivalence may be defined by comparing the representations of G on the spaces of holomorphic q-differentials Hq(S1) and Hq(S2). In this note we study the differences between topological equivalence and Hq equivalence of prime cyclic actions, where S1/G and S2/G have genus zero.
Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann
Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann
Mathematical Sciences Technical Reports (MSTR)
As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is thought that the functions that such schemes use have inverses that are computationally intractable. In relation to this, we are interested in counting the solutions to a generalization of the discrete logarithm problem modulo a prime power. This is achieved by interpolating to p-adic functions, and using Hensel's lemma, or other methods in the case of singular lifting, and the Chinese Remainder Theorem.
Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech
Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech
Mathematical Sciences Technical Reports (MSTR)
The increased use of cryptography to protect our personal information makes us want to understand the security of cryptosystems. The security of many cryptosystems relies on solving the discrete logarithm, which is thought to be relatively difficult. Therefore, we focus on the statistical analysis of certain properties of the graph of the discrete logarithm. We discovered the expected value and variance of a certain property of the graph and compare the expected value to experimental data. Our finding did not coincide with our intuition of the data following a Gaussian distribution given a large sample size. Thus, we found the …
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Mathematical Sciences Technical Reports (MSTR)
Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.
Quasi-Platonic Psl2(Q)-Actions On Closed Riemann Surfaces, Sean A. Broughton
Quasi-Platonic Psl2(Q)-Actions On Closed Riemann Surfaces, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
This paper is the first of two papers whose combined goal is to explore the dessins d'enfant and symmetries of quasi-platonic actions of PSL2(q). A quasi-platonic action of a group G on a closed Riemann S surface is a conformal action for which S/G is a sphere and S->S/G is branched over {0, 1,infinity}. The unit interval in S/G may be lifted to a dessin d'enfant D, an embedded bipartite graph in S. The dessin forms the edges and vertices of a tiling on S by dihedrally symmetric polygons, generalizing the idea of a …
Spontaneous Synchrony On Graphs And The Emergence Of Order From Disorder, Dylan Linville, Daniel Trugillo Martins Fontes
Spontaneous Synchrony On Graphs And The Emergence Of Order From Disorder, Dylan Linville, Daniel Trugillo Martins Fontes
Mathematical Sciences Technical Reports (MSTR)
From pulsars to pedestrians and bacteria to brain cells, objects that exhibit cyclical behavior, called oscillators, are found in a variety of different settings. When oscillators adjust their behavior in response to nearby oscillators, they often achieve a state of synchrony, in which they all have the same phase and frequency. Here, we explore the Kuramoto model, a simple and general model which describes oscillators as dynamical systems on a graph and has been used to study synchronization in systems ranging from firefly swarms to the power grid. We discuss analytical and numerical methods used to investigate the governing system …
Continuous Dependence Of Solutions Of Equations On Parameters, Sean A. Broughton
Continuous Dependence Of Solutions Of Equations On Parameters, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
It is shown under very general conditions that the solutions of equations depend continuously on the coefficients or parameters of the equations. The standard examples are solutions of monic polynomial equations and the eigenvalues of a matrix. However, the proof methods apply to any finite map T : Cn -> Cn.
Calculation Of The Killing Form Of A Simple Lie Group, Sean A. Broughton
Calculation Of The Killing Form Of A Simple Lie Group, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
The Killing form of a simple Lie Algebra is determined from invariants of the extended root diagrams of the Lie algebra.
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Mathematical Sciences Technical Reports (MSTR)
The Welch map x -> gx-1+c is similar to the discrete exponential map x -> gx, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: gx-1+c = x (mod pe) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo pe, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …
Fundamentals Of Protein Structure Alignment, Allen Holder, Mark Brandt, Yosi Shibberu
Fundamentals Of Protein Structure Alignment, Allen Holder, Mark Brandt, Yosi Shibberu
Mathematical Sciences Technical Reports (MSTR)
The central dogma of molecular biology asserts a one way transfer of information from a cell’s genetic code to the expression of proteins. Proteins are the functional workhorses of a cell, and studying these molecules is at the foundation of much of computational biology. Our goal here is to present a succinct introduction to the biological, mathematical, and computational aspects of making pairwise comparisons between protein structures. The presentation is intended to be useful for those who are entering this research area. The chapter begins with a brief introduction to the biology of protein comparison, which is followed by a …
The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans
The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans
Mathematical Sciences Technical Reports (MSTR)
The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve discrete logarithm problem (ECDLP) is an open problem in the field of number theory, and its applications to modern cryptographic algorithms are numerous. This paper focuses on a statistical analysis of a modification to the ECDLP, called the x-ECDLP, where one is only given the xcoordinate of a point, instead of the entire point. Focusing only on elliptic curves whose field of definition is smaller than the number of points, this paper attempts to find a statistical indication of underlying structure (or lack thereof) in the …