Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Mathematics
Towards A Theory Of Recursive Function Complexity: Sigma Matrices And Inverse Complexity Measures, Bradford M. Fournier
Towards A Theory Of Recursive Function Complexity: Sigma Matrices And Inverse Complexity Measures, Bradford M. Fournier
University of New Orleans Theses and Dissertations
This paper develops a data structure based on preimage sets of functions on a finite set. This structure, called the sigma matrix, is shown to be particularly well-suited for exploring the structural characteristics of recursive functions relevant to investigations of complexity. The matrix is easy to compute by hand, defined for any finite function, reflects intrinsic properties of its generating function, and the map taking functions to sigma matrices admits a simple polynomial-time algorithm . Finally, we develop a flexible measure of preimage complexity using the aforementioned matrix. This measure naturally partitions all functions on a finite set by characteristics …
In Honor And Memory Of Professor Lajos Takács, Aliakbar M. Haghighi, Sri G. Mohanty
In Honor And Memory Of Professor Lajos Takács, Aliakbar M. Haghighi, Sri G. Mohanty
Applications and Applied Mathematics: An International Journal (AAM)
This issue of AAM is dedicated to honoring and remembering Professor Lajos Takács. While wrapping up the manuscript of my book (co-authored by Dr. Dimitar Mishev): Delayed and Network Queues, I went back to celebrate his 1962 book, Introduction to the Theory of Queues, where he gives an example illustrating a waiting time paradox, where the waiting time of a passenger waiting for a bus at a bus stop is infinite, while, in reality, he will wait a finite unit of time before a bus arrive. I sent Professor Takács an e-mail on December 4, 2015, inquiring if he had …
The Apprentices' Tower Of Hanoi, Cory Bh Ball
The Apprentices' Tower Of Hanoi, Cory Bh Ball
Electronic Theses and Dissertations
The Apprentices' Tower of Hanoi is introduced in this thesis. Several bounds are found in regards to optimal algorithms which solve the puzzle. Graph theoretic properties of the associated state graphs are explored. A brief summary of other Tower of Hanoi variants is also presented.
I Don't Play Chess: A Study Of Chess Piece Generating Polynomials, Stephen R. Skoch
I Don't Play Chess: A Study Of Chess Piece Generating Polynomials, Stephen R. Skoch
Senior Independent Study Theses
This independent study examines counting problems of non-attacking rook, and non-attacking bishop placements. We examine boards for rook and bishop placement with restricted positions and varied dimensions. In this investigation, we discuss the general formula of a generating function for unrestricted, square bishop boards that relies on the Stirling numbers of the second kind. We discuss the maximum number of bishops we can place on a rectangular board, as well as a brief investigation of non-attacking rook placements on three-dimensional boards, drawing a connection to latin squares.
A Combinatorial Exploration Of Elliptic Curves, Matthew Lam
A Combinatorial Exploration Of Elliptic Curves, Matthew Lam
HMC Senior Theses
At the intersection of algebraic geometry, number theory, and combinatorics, an interesting problem is counting points on an algebraic curve over a finite field. When specialized to the case of elliptic curves, this question leads to a surprising connection with a particular family of graphs. In this document, we present some of the underlying theory and then summarize recent results concerning the aforementioned relationship between elliptic curves and graphs. A few results are additionally further elucidated by theory that was omitted in their original presentation.
On Representations Of Semigroups Having Hypercube-Like Cayley Graphs, Cody Cassiday, G. Stacey Staples
On Representations Of Semigroups Having Hypercube-Like Cayley Graphs, Cody Cassiday, G. Stacey Staples
SIUE Faculty Research, Scholarship, and Creative Activity
The $n-dimensional hypercube, or n-cube, is the Cayley graph of the Abelian group Z2n. A number of combinatorially-interesting groups and semigroups arise from modified hypercubes. The inherent combinatorial properties of these groups and semigroups make them useful in a number of contexts, including coding theory, graph theory, stochastic processes, and even quantum mechanics. In this paper, particular groups and semigroups whose Cayley graphs are generalizations of hypercubes are described, and their irreducible representations are characterized. Constructions of faithful representations are also presented for each semigroup. The associated semigroup algebras are realized within the context …