Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Georgia Southern University (12)
- Chapman University (11)
- University of New Mexico (8)
- Prairie View A&M University (6)
- Claremont Colleges (5)
-
- Southern Illinois University Edwardsville (4)
- University of Kentucky (4)
- East Tennessee State University (3)
- Selected Works (3)
- Linfield University (2)
- Portland State University (2)
- San Jose State University (2)
- Smith College (2)
- University of Nebraska - Lincoln (2)
- University of New Orleans (2)
- Virginia Commonwealth University (2)
- Western Kentucky University (2)
- Air Force Institute of Technology (1)
- Ateneo de Manila University (1)
- Boise State University (1)
- Bucknell University (1)
- City University of New York (CUNY) (1)
- Embry-Riddle Aeronautical University (1)
- Gettysburg College (1)
- Hamilton College (1)
- Illinois Wesleyan University (1)
- Marshall University (1)
- Michigan Technological University (1)
- The College of Wooster (1)
- The University of Akron (1)
- Keyword
-
- Combinatorics (6)
- Graph theory (5)
- Neutrosophic logic (5)
- Clifford algebras (3)
- 05A15 Exact enumeration problems (2)
-
- Domination (2)
- ETD (2)
- Groupoid (2)
- Infinite products (2)
- K-forcing number (2)
- Layered permutations (2)
- Mathematics (2)
- Möbius function (2)
- Number theory (2)
- Pattern poset (2)
- Representation theory (2)
- Reproducing kernels (2)
- Schur functions (2)
- Shellable (2)
- Slice hyperholomorphic functions (2)
- Trees (2)
- 05-02 Combinatorics Research exposition (1)
- 05B45 Tessellation and tiling problems (1)
- 4-Cycle (1)
- 5-Cycle (1)
- 68P25 Data encryption (1)
- 94A60 Cryptography (1)
- Abel Grassmann Groupoid (1)
- Abel Grassmann groupoid (1)
- Additive coloring (1)
- Publication
-
- Mathematics, Physics, and Computer Science Faculty Articles and Research (11)
- Branch Mathematics and Statistics Faculty and Staff Publications (8)
- Theory and Applications of Graphs (8)
- Applications and Applied Mathematics: An International Journal (AAM) (6)
- Electronic Theses and Dissertations (6)
-
- Faculty Publications (4)
- HMC Senior Theses (4)
- SIUE Faculty Research, Scholarship, and Creative Activity (4)
- Theses and Dissertations--Mathematics (4)
- Theses and Dissertations (3)
- Department of Mathematics: Dissertations, Theses, and Student Research (2)
- Masters Theses & Specialist Projects (2)
- Mathematics and Statistics Faculty Publications and Presentations (2)
- Peter R. W. McNamara (2)
- University of New Orleans Theses and Dissertations (2)
- Articles (1)
- Computer Science: Faculty Publications (1)
- Dissertations, Master's Theses and Master's Reports (1)
- Doctoral Dissertations (1)
- Faculty Journal Articles (1)
- GS4 Georgia Southern Student Scholars Symposium (1)
- Graduate Student Publications and Research (1)
- Honors Projects (1)
- Idaho Conference on Undergraduate Research (1)
- Journal of Humanistic Mathematics (1)
- Luca De Benedictis (1)
- Math Faculty Publications (1)
- Mathematics Faculty Publications (1)
- Mathematics Faculty Research (1)
- Mathematics Sciences: Faculty Publications (1)
- Publication Type
Articles 31 - 60 of 88
Full-Text Articles in Mathematics
Comparing Skew Schur Functions: A Quasisymmetric Perspective, Peter R. W. Mcnamara
Comparing Skew Schur Functions: A Quasisymmetric Perspective, Peter R. W. Mcnamara
Peter R. W. McNamara
Reiner, Shaw and van Willigenburg showed that if two skew Schur functions sA and sB are equal, then the skew shapes $A$ and $B$ must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a much weaker condition than Schur equality: that sA and sB have the same support when expanded in the fundamental quasisymmetric basis F. Surprisingly, there is significant evidence supporting a conjecture that the converse is also true.
In fact, we work in terms of inequalities, showing that if the F-support of sA …
Periodic Body-And-Bar Frameworks, Ciprian Borcea, Ileana Streinu, Shin-Ichi Tanigawa
Periodic Body-And-Bar Frameworks, Ciprian Borcea, Ileana Streinu, Shin-Ichi Tanigawa
Computer Science: Faculty Publications
Periodic body-and-bar frameworks are abstractions of crystalline structures made of rigid bodies connected by fixed-length bars and subject to the action of a lattice of translations. We give a Maxwell–Laman characterization for minimally rigid periodic body-and-bar frameworks in terms of their quotient graphs. As a consequence we obtain efficient polynomial time algorithms for their recognition based on matroid partition and pebble games.
Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair
Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair
Graduate Student Publications and Research
Let p_b(n) be the number of integer partitions of n whose parts are powers of b. For each m there is a generating function identity:
f_m(b,q)\sum_{n} p_b(n) q^n = (1-q)^m \sum_{n} p_b(b^m n q)q^n
where n ranges over all integer values. The proof of this identity appears in the doctoral thesis of the author. For more information see http://dakota.tensen.net/2015/rp/.
This dataset is a JSON object with keys m from 1 to 23 whose values are f_m(b,q).
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.
Extremal Theorems For Degree Sequence Packing And The Two-Color Discrete Tomography Problem, Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam, James Shook
Extremal Theorems For Degree Sequence Packing And The Two-Color Discrete Tomography Problem, Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam, James Shook
Faculty Publications
No abstract provided.
The Game Chromatic Number Of Trees And Forests, Charles Dunn, Victor Larsen, Troy Retter, Kira Lindke, Dustin Toci
The Game Chromatic Number Of Trees And Forests, Charles Dunn, Victor Larsen, Troy Retter, Kira Lindke, Dustin Toci
Faculty Publications
While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and then investigate the differences between forests with game chromatic number 3 and 4. In doing so, we present a minimal example of a forest with game chromatic number 4, criteria for determining in polynomial time the game chromatic number of a forest without vertices of degree 3, and an example of a forest with maximum degree …
The Relaxed Edge-Coloring Game And K-Degenerate Graphs, Charles Dunn, David Morawski, Jennifer Firkins Nordstrom
The Relaxed Edge-Coloring Game And K-Degenerate Graphs, Charles Dunn, David Morawski, Jennifer Firkins Nordstrom
Faculty Publications
The (r, d)-relaxed edge-coloring game is a two-player game using r colors played on the edge set of a graph G. We consider this game on forests and more generally, on k-degenerate graphs. If F is a forest with ∆(F) = ∆, then the first player, Alice, has a winning strategy for this game with r = ∆ − j and d ≥ 2j + 2 for 0 ≤ j ≤ ∆ − 1. This both improves and generalizes the result for trees in [10]. More broadly, we generalize the main result in [10] …
Domination Numbers Of Semi-Strong Products Of Graphs, Stephen R. Cheney
Domination Numbers Of Semi-Strong Products Of Graphs, Stephen R. Cheney
Theses and Dissertations
This thesis examines the domination number of the semi-strong product of two graphs G and H where both G and H are simple and connected graphs. The product has an edge set that is the union of the edge set of the direct product of G and H together with the cardinality of V(H), copies of G. Unlike the other more common products (Cartesian, direct and strong), the semi-strong product is neither commutative nor associative.
The semi-strong product is not supermultiplicative, so it does not satisfy a Vizing like conjecture. It is also not submultiplicative so it shares these two …
An Exposition Of Kasteleyn's Solution Of The Dimer Model, Eric Stucky
An Exposition Of Kasteleyn's Solution Of The Dimer Model, Eric Stucky
HMC Senior Theses
In 1961, P. W. Kasteleyn provided a baffling-looking solution to an apparently simple tiling problem: how many ways are there to tile a rectangular region with dominos? We examine his proof, simplifying and clarifying it into this nearly self-contained work.
Mod Planes: A New Dimension To Modulo Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Mod Planes: A New Dimension To Modulo Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book for the first time authors study mod planes using modulo intervals [0, m); 2 ≤ m ≤ ∞. These planes unlike the real plane have only one quadrant so the study is carried out in a compact space but infinite in dimension. We have given seven mod planes viz real mod planes (mod real plane) finite complex mod plane, neutrosophic mod plane, fuzzy mod plane, (or mod fuzzy plane), mod dual number plane, mod special dual like number plane and mod special quasi dual number plane. These mod planes unlike real plane or complex plane or neutrosophic …
Non-Simplicial Decompositions Of Betti Diagrams Of Complete Intersections, Courtney Gibbons, Jack Jeffries, Sarah Mayes-Tang, Claudiu Raicu, Branden Stone, Bryan White
Non-Simplicial Decompositions Of Betti Diagrams Of Complete Intersections, Courtney Gibbons, Jack Jeffries, Sarah Mayes-Tang, Claudiu Raicu, Branden Stone, Bryan White
Articles
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-Soederberg theory. That is, given a Betti diagram, we decompose it into pure diagrams. Relaxing the requirement that the degree sequences in such pure diagrams be totally ordered, we are able to define a multiplication law for Betti diagrams that respects the decomposition and allows us to write a simple expression of the decomposition of the Betti diagram of any complete intersection in terms of the degrees of its minimal generators. In the more traditional sense, the decomposition of complete intersections of codimension at most 3 …
Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak
Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak
Theory and Applications of Graphs
The (vertex) path-table of a tree Τ contains quantitative information about the paths in Τ. The entry (i,j) of this table gives the number of paths of length j passing through vertex vi. The path-table is a slight variation of the notion of path layer matrix. In this survey we review some work done on the vertex path-table of a tree and also introduce the edge path-table. We show that in general, any type of path-table of a tree Τ does not determine Τ uniquely. We shall show that in trees, the number of paths passing through …
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.
A Plausibly Deniable Encryption Scheme For Personal Data Storage, Andrew Brockmann
A Plausibly Deniable Encryption Scheme For Personal Data Storage, Andrew Brockmann
HMC Senior Theses
Even if an encryption algorithm is mathematically strong, humans inevitably make for a weak link in most security protocols. A sufficiently threatening adversary will typically be able to force people to reveal their encrypted data. Methods of deniable encryption seek to mend this vulnerability by allowing for decryption to alternate data which is plausible but not sensitive. Existing schemes which allow for deniable encryption are best suited for use by parties who wish to communicate with one another. They are not, however, ideal for personal data storage. This paper develops a plausibly-deniable encryption system for use with personal data storage, …
Chromatic Polynomials And Orbital Chromatic Polynomials And Their Roots, Jazmin Ortiz
Chromatic Polynomials And Orbital Chromatic Polynomials And Their Roots, Jazmin Ortiz
HMC Senior Theses
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is the number of proper k colorings of the graph. We can then find the orbital chromatic polynomial of a graph and a group of automorphisms of the graph, which is a polynomial whose value at a positive integer k is the number of orbits of k-colorings of a graph when acted upon by the group. By considering the roots of the orbital chromatic and chromatic polynomials, the similarities and differences of these polynomials is studied. Specifically we work toward proving a conjecture …
Kravchuk Polynomials And Induced/Reduced Operators On Clifford Algebras, G. Stacey Staples
Kravchuk Polynomials And Induced/Reduced Operators On Clifford Algebras, G. Stacey Staples
SIUE Faculty Research, Scholarship, and Creative Activity
Kravchuk polynomials arise as orthogonal polynomials with respect to the binomial distribution and have numerous applications in harmonic analysis, statistics, coding theory, and quantum probability. The relationship between Kravchuk polynomials and Clifford algebras is multifaceted. In this paper, Kravchuk polynomials are discovered as traces of conjugation operators in Clifford algebras, and appear in Clifford Berezin integrals of Clifford polynomials. Regarding Kravchuk matrices as linear operators on a vector space V, the action induced on the Clifford algebra over V is equivalent to blade conjugation, i.e., reflections across sets of orthogonal hyperplanes. Such operators also have a natural interpretation in …
Deletion-Induced Triangulations, Clifford T. Taylor
Deletion-Induced Triangulations, Clifford T. Taylor
Theses and Dissertations--Mathematics
Let d > 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we lift into ℝd+1. Further let k be an integer satisfying 0 ≤ k ≤ n-(d+2) and assign to each k-subset of the points of A a (regular) triangulation obtained by deleting the specified k-subset and projecting down the lower hull of the convex hull of the resulting lifting. Next, for each triangulation we form the characteristic vector defined by Gelfand, Kapranov, and Zelevinsky by assigning to each …
Some Properties Of The Exchange Operator With Respect To Structured Matrices Defined By Indefinite Scalar Product Spaces, Hanz Martin C. Cheng, Roden Jason David
Some Properties Of The Exchange Operator With Respect To Structured Matrices Defined By Indefinite Scalar Product Spaces, Hanz Martin C. Cheng, Roden Jason David
Mathematics Faculty Publications
The properties of the exchange operator on some types of matrices are explored in this paper. In particular, the properties of exc(A,p,q), where A is a given structured matrix of size (p+q)Ã(p+q) and exc : M ÃNÃN â M is the exchange operator are studied. This paper is a generalization of one of the results in [N.J. Higham. J-orthogonal matrices: Properties and generation. SIAM Review, 45:504â519, 2003.].
Combinatorial Potpourri: Permutations, Products, Posets, And Pfaffians, Norman B. Fox
Combinatorial Potpourri: Permutations, Products, Posets, And Pfaffians, Norman B. Fox
Theses and Dissertations--Mathematics
In this dissertation we first examine the descent set polynomial, which is defined in terms of the descent set statistics of the symmetric group. Algebraic and topological tools are used to explain why large classes of cyclotomic polynomials are factors of the descent set polynomial. Next the diamond product of two Eulerian posets is studied, particularly by examining the effect this product has on their cd-indices. A combinatorial interpretation involving weighted lattice paths is introduced to describe the outcome of applying the diamond product operator to two cd-monomials. Then the cd-index is defined for infinite posets, with …
Unimodality Questions In Ehrhart Theory, Robert Davis
Unimodality Questions In Ehrhart Theory, Robert Davis
Theses and Dissertations--Mathematics
An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal h*-vector.Although various sufficient conditions have been found, necessary conditions remain a challenge. Highly-structured polytopes, such as the polytope of real doubly-stochastic matrices, have been proven to possess unimodal h*-vectors, but the same is unknown even for small variations of it.
In this dissertation, we mainly consider two particular classes of polytopes: reflexive simplices and the polytope of symmetric real doubly-stochastic matrices. For the first class, we discuss an operation that preserves reflexivity, integral closure, and unimodality of the h* …
Wiener-Chaos Approach To Optimal Prediction, Daniel Alpay, Alon Kipnis
Wiener-Chaos Approach To Optimal Prediction, Daniel Alpay, Alon Kipnis
Mathematics, Physics, and Computer Science Faculty Articles and Research
In this work we combine Wiener chaos expansion approach to study the dynamics of a stochastic system with the classical problem of the prediction of a Gaussian process based on part of its sample path. This is done by considering special bases for the Gaussian space G generated by the process, which allows us to obtain an orthogonal basis for the Fock space of G such that each basis element is either measurable or independent with respect to the given samples. This allows us to easily derive the chaos expansion of a random variable conditioned on part of the sample …
Quaternionic Hardy Spaces In The Open Unit Ball And Half Space And Blaschke Products, Daniel Alpay, Fabrizio Colombo, Irene Sabadini
Quaternionic Hardy Spaces In The Open Unit Ball And Half Space And Blaschke Products, Daniel Alpay, Fabrizio Colombo, Irene Sabadini
Mathematics, Physics, and Computer Science Faculty Articles and Research
The Hardy spaces H2(B) and H2(H+), where B and H+ denote, respectively, the open unit ball of the quaternions and the half space of quaternions with positive real part, as well as Blaschke products, have been intensively studied in a series of papers where they are used as a tool to prove other results in Schur analysis. This paper gives an overview on the topic, collecting the various results available.
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 …
Neutrosophic Graphs: A New Dimension To Graph Theory, Florentin Smarandache, Wb. Vasantha Kandasamy, K. Ilanthenral
Neutrosophic Graphs: A New Dimension To Graph Theory, Florentin Smarandache, Wb. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time have made a through study of neutrosophic graphs. This study reveals that these neutrosophic graphs give a new dimension to graph theory. The important feature of this book is it contains over 200 neutrosophic graphs to provide better understanding of this concepts. Further these graphs happen to behave in a unique way inmost cases, for even the edge colouring problem is different from the classical one. Several directions and dimensions in graph theory are obtained from this study. Finally certainly these new notions of neutrosophic graphs in general and in particular the …
Special Type Of Topological Spaces Using [0, N), Florentin Smarandache, W.B Vasantha Kandasamy
Special Type Of Topological Spaces Using [0, N), Florentin Smarandache, W.B Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of special type of topological spaces using the interval [0, n). They are very different from the usual topological spaces. Algebraic structure using the interval [0, n) have been systemically dealt by the authors. Now using those algebraic structures in this book authors introduce the notion of special type of topological spaces. Using the super subset interval semigroup special type of super interval topological spaces are built. Several interesting results in this direction are obtained. Next six types of topological spaces using subset interval pseudo ring semiring of type …
Mod Functions: A New Approach To Function Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Mod Functions: A New Approach To Function Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the notion of MOD functions are defined on MOD planes. This new concept of MOD functions behaves in a very different way. Even very simple functions like y = nx has several zeros in MOD planes where as they are nice single line graphs with only (0, 0) as the only zero. Further polynomials in MOD planes do not in general follows the usual or classical laws of differentiation or integration. Even finding roots of MOD polynomials happens to be very difficult as they do not follow the fundamental theorem of algebra, viz a nth degree polynomial …
Realizations Of Infinite Products, Ruelle Operators And Wavelet Filters, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz
Realizations Of Infinite Products, Ruelle Operators And Wavelet Filters, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz
Mathematics, Physics, and Computer Science Faculty Articles and Research
Using the system theory notion of state-space realization of matrix-valued rational functions, we describe the Ruelle operator associated with wavelet filters. The resulting realization of infinite products of rational functions have the following four features: 1) It is defined in an infinite-dimensional complex domain. 2) Starting with a realization of a single rational matrix-function M, we show that a resulting infinite product realization obtained from M takes the form of an (infinitedimensional) Toeplitz operator with the symbol that is a reflection of the initial realization for M. 3) Starting with a subclass of rational matrix functions, including scalar-valued ones corresponding …
Lucky Choice Number Of Planar Graphs With Given Girth, Axel Brandt, Jennifer Diemunsch, Sogol Jahanbekam
Lucky Choice Number Of Planar Graphs With Given Girth, Axel Brandt, Jennifer Diemunsch, Sogol Jahanbekam
Faculty Publications
No abstract provided.
Operator Calculus Algorithms For Multi-Constrained Paths, Jamila Ben Slimane, Rene' Schott, Ye Qiong Song, G. Stacey Staples, Evangelia Tsiontsiou
Operator Calculus Algorithms For Multi-Constrained Paths, Jamila Ben Slimane, Rene' Schott, Ye Qiong Song, G. Stacey Staples, Evangelia Tsiontsiou
SIUE Faculty Research, Scholarship, and Creative Activity
Classical approaches to multi-constrained routing problems generally require construction of trees and the use of heuristics to prevent combinatorial explosion. Introduced here is the notion of constrained path algebras and their application to multi-constrained path problems. The inherent combinatorial properties of these algebras make them useful for routing problems by implicitly pruning the underlying tree structures. Operator calculus (OC) methods are generalized to multiple non-additive constraints in order to develop algorithms for the multi constrained path problem and multi constrained optimization problem. Theoretical underpinnings are developed first, then algorithms are presented. These algorithms demonstrate the tremendous simplicity, flexibility and speed …
Clifford Algebra Decompositions Of Conformal Orthogonal Group Elements, G. Stacey Staples, David Wylie
Clifford Algebra Decompositions Of Conformal Orthogonal Group Elements, G. Stacey Staples, David Wylie
SIUE Faculty Research, Scholarship, and Creative Activity
Beginning with a finite-dimensional vector space V equipped with a nondegenerate quadratic form Q, we consider the decompositions of elements of the conformal orthogonal group COQ(V), defined as the direct product of the orthogonal group OQ(V) with dilations. Utilizing the correspondence between conformal orthogonal group elements and ``decomposable'' elements of the associated Clifford algebra, ClQ(V), a decomposition algorithm is developed. Preliminary results on complexity reductions that can be realized passing from additive to multiplicative representations of invertible elements are also presented with examples. The approach here is …