Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Automorphism Groups of Free Groups (1)
- Blum-Micali (1)
- Cantor Sets (1)
- Commutativity Generalization (1)
- Computational complexity (1)
-
- Continued Fractions (1)
- Deficient rectangles (1)
- Dihedral Group (1)
- Elliptic curve (1)
- Fay Identities (1)
- Finite element method (1)
- Fluid dynamics (1)
- Fractals (1)
- Generating function (1)
- Graph theory (1)
- Group Theory (1)
- Hadamard product (1)
- Integrable systems (1)
- Isogeny (1)
- J-invariant (1)
- Least Squares (1)
- Minimization (1)
- Navier-Stokes (1)
- Non-Abelian (1)
- Number theory (1)
- Partial fraction expansion (1)
- Pentominoes (1)
- Polyominoes (1)
- Pseudorandom (1)
- Quantum Computation (1)
- Publication
- Publication Type
Articles 1 - 12 of 12
Full-Text Articles in Entire DC Network
Studying Extended Sets From Young Tableaux, Eric Nofziger
Studying Extended Sets From Young Tableaux, Eric Nofziger
Rose-Hulman Undergraduate Mathematics Journal
Young tableaux are combinatorial objects related to the partitions of an integer and have various applications in representation theory. They are particularly useful in the study of the fibers arising from the Springer resolution. In recent work of Graham-Precup-Russell, an association has been made between a given row-strict tableau and three disjoint subsets of {1,2,...,n}. These subsets are then used in the study of extended Springer fibers, so we call them extended sets. In this project, we use combinatorial techniques to classify which of these extended sets correlate to a valid row-strict or standard tableau and give bounds on the …
On The Smallest Non-Trivial Action Of Saut(Fn) For Small N, Reemon Spector
On The Smallest Non-Trivial Action Of Saut(Fn) For Small N, Reemon Spector
Rose-Hulman Undergraduate Mathematics Journal
In this paper we investigate actions of SAut(Fn), the unique index 2 subgroup of Aut(Fn), on small sets, improving upon results by Baumeister--Kielak--Pierro for several small values of n. Using a computational approach for n ⩾ 5, we show that every action of SAut(Fn) on a set containing fewer than 20 elements is trivial.
Generalizations Of Commutativity In Dihedral Groups, Noah A. Heckenlively
Generalizations Of Commutativity In Dihedral Groups, Noah A. Heckenlively
Rose-Hulman Undergraduate Mathematics Journal
The probability that two elements commute in a non-Abelian finite group is at most 5 8 . We prove several generalizations of this result for dihedral groups. In particular, we give specific values for the probability that a product of an arbitrary number of dihedral group elements is equal to its reverse, and also for the probability that a product of three elements is equal to a permutation of itself or to a cyclic permutation of itself. We also show that for any r and n, there exists a dihedral group such that the probability that a product of n …
On Cantor Sets Defined By Generalized Continued Fractions, Danielle Hedvig, Masha Gorodetski
On Cantor Sets Defined By Generalized Continued Fractions, Danielle Hedvig, Masha Gorodetski
Rose-Hulman Undergraduate Mathematics Journal
We study a special class of generalized continuous fractions, both in real and complex settings, and show that in many cases, the set of numbers that can be represented by a continued fraction for that class form a Cantor set. Specifically, we study generalized continued fractions with a fixed absolute value and a variable coefficient sign. We ask the same question in the complex setting, allowing the coefficient's argument to be a multiple of \pi/2. The numerical experiments we conducted showed that in these settings the set of numbers formed by such continued fractions is a Cantor set for large …
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.
Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden
Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden
Rose-Hulman Undergraduate Mathematics Journal
The Navier-Stokes equations are used to model fluid flow. Examples include fluid structure interactions in the heart, climate and weather modeling, and flow simulations in computer gaming and entertainment. The equations date back to the 1800s, but research and development of numerical approximation algorithms continues to be an active area. To numerically solve the Navier-Stokes equations we implement a least squares finite element algorithm based on work by Roland Glowinski and colleagues. We use the deal.II academic library , the C++ language, and the Linux operating system to implement the solver. We investigate convergence rates and apply the least squares …
Tiling Rectangles And 2-Deficient Rectangles With L-Pentominoes, Monica Kane
Tiling Rectangles And 2-Deficient Rectangles With L-Pentominoes, Monica Kane
Rose-Hulman Undergraduate Mathematics Journal
We investigate tiling rectangles and 2-deficient rectangles with L-pentominoes. First, we determine exactly when a rectangle can be tiled with L-pentominoes. We then determine locations for pairs of unit squares that can always be removed from an m × n rectangle to produce a tileable 2-deficient rectangle when m ≡ 1 (mod 5), n ≡ 2 (mod 5) and when m ≡ 3 (mod 5), n ≡ 4 (mod 5).
On Isomorphic K-Rational Groups Of Isogenous Elliptic Curves Over Finite Fields, Ben Kuehnert, Geneva Schlafly, Zecheng Yi
On Isomorphic K-Rational Groups Of Isogenous Elliptic Curves Over Finite Fields, Ben Kuehnert, Geneva Schlafly, Zecheng Yi
Rose-Hulman Undergraduate Mathematics Journal
It is well known that two elliptic curves are isogenous if and only if they have same number of rational points. In fact, isogenous curves can even have isomorphic groups of rational points in certain cases. In this paper, we consolidate all the current literature on this relationship and give a extensive classification of the conditions in which this relationship arises. First we prove two ordinary isogenous elliptic curves have isomorphic groups of rational points when they have the same $j$-invariant. Then, we extend this result to certain isogenous supersingular elliptic curves, namely those with equal $j$-invariant of either 0 …
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 …
A New Method To Compute The Hadamard Product Of Two Rational Functions, Ishan Kar
A New Method To Compute The Hadamard Product Of Two Rational Functions, Ishan Kar
Rose-Hulman Undergraduate Mathematics Journal
The Hadamard product (denoted by∗) of two power series A(x) =a0+a1x+a2x2+···and B(x) =b0+b1x+b2x2+··· is the power series A(x)∗B(x) =a0b0+a1b1x+a2b2x2+···. Although it is well known that the Hadamard product of two rational functions is also rational, a closed form expression of the Hadamard product of rational functions has not been found. Since any rational power series can be expanded by partial fractions as a polynomial plus a sum of power series …
Additional Fay Identities Of The Extended Toda Hierarchy, Yu Wan
Additional Fay Identities Of The Extended Toda Hierarchy, Yu Wan
Rose-Hulman Undergraduate Mathematics Journal
The focus of this paper is the extended Toda Lattice hierarchy, an infinite system of partial differential equations arising from the Toda lattice equation. We begin by giving the definition of the extended Toda hierarchy and its explicit bilinear equation, following Takasaki’s construction. We then derive a series of new Fay identities. Finally, we discover a general formula for one type of Fay identity.