Mathematics Commons^™

Skew Row-Strict Quasisymmetric Schur Functions, Sarah K. Mason, Elizabeth Niese

Mathematics Faculty Research

Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict tableaux that generate Schur functions. We introduce a modification known as Young row-strict quasisymmetric Schur functions, which are generated by row-strict Young composition fillings. After discussing basic combinatorial properties of these functions, we define a skew Young row-strict quasisymmetric Schur function using the Hopf algebra of quasisymmetric functions and then prove this is equivalent to a combinatorial description. We also provide a decomposition of the skew Young row-strict …

Graph Centers, Hypergraph Degree Sequences, And Induced-Saturation, Sarah Lynne Behrens

Department of Mathematics: Dissertations, Theses, and Student Research

The center of a graph is the set of vertices whose distance to other vertices is minimal. The centralizing number of a graph G is the minimum number of additional vertices in any graph H where V(G) is the center of H. Buckley, Miller, and Slater and He and Liu provided infinite families of graphs with each centralizing number. We show the number of graphs with each nonzero centralizing number grows super-exponentially with the number of vertices. We also provide a method of altering graphs without changing the centralizing number and give results about the centralizing …

The Robinson-Schensted Correspondence And A2-Web Bases, Matthew Housley, Heather M. Russell, Julianna Tymoczko

Mathematics Sciences: Faculty Publications

We study natural bases for two constructions of the irreducible representation of the symmetric group corresponding to [n, n, n]: the reduced web basis associated to Kuperberg’s combinatorial description of the spider category; and the left cell basis for the left cell construction of Kazhdan and Lusztig. In the case of [n, n], the spider category is the Temperley-Lieb category; reduced webs correspond to planar matchings, which are equivalent to left cell bases. This paper compares the image of these bases under classical maps: the Robinson–Schensted algorithm between permutations and Young tableaux and Khovanov–Kuperberg’s bijection between Young tableaux and reduced …

On A Convex Set With Nondifferentiable Metric Projection, Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman

Mathematics and Statistics Faculty Publications and Presentations

A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with smooth boundary which possesses the same property.

On The Topology Of The Permutation Pattern Poset, Peter R. W. Mcnamara, Einar Steingrímsson

Faculty Journal Articles

The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a disconnected subinterval and are thus not shellable. Nevertheless, there seem to be large classes of intervals that are shellable and thus have the homotopy type of a wedge of spheres. We prove this to be the case for all intervals of layered permutations that have no disconnected subintervals of rank 3 or more. We also characterize in a simple way …

A Posteriori Eigenvalue Error Estimation For The Schrödinger Operator With The Inverse Square Potential, Hengguang Li, Jeffrey S. Ovall

Mathematics and Statistics Faculty Publications and Presentations

We develop an a posteriori error estimate of hierarchical type for Dirichlet eigenvalue problems of the form (−∆ + (c/r) 2 )ψ = λψ on bounded domains Ω, where r is the distance to the origin, which is assumed to be in Ω. This error estimate is proven to be asymptotically identical to the eigenvalue approximation error on a family of geometrically-graded meshes. Numerical experiments demonstrate this asymptotic exactness in practice.

Expectation Numbers Of Cyclic Groups, Miriam Mahannah El-Farrah

Masters Theses & Specialist Projects

When choosing k random elements from a group the kth expectation number is the expected size of the subgroup generated by those specific elements. The main purpose of this thesis is to study the asymptotic properties for the first and second expectation numbers of large cyclic groups. The first chapter introduces the kth expectation number. This formula allows us to determine the expected size of any group. Explicit examples and computations of the first and second expectation number are given in the second chapter. Here we show example of both cyclic and dihedral groups. In chapter three we discuss arithmetic …

Extremal Results For The Number Of Matchings And Independent Sets, Lauren Keough

Department of Mathematics: Dissertations, Theses, and Student Research

This dissertation answers several questions in extremal graph theory, each concerning the maximum or minimum number of certain substructures a graph can have, given that it must satisfy certain properties. In recent years there has been increased interest in such problems, which are extremal problems for "counting" parameters of graphs. The results in this dissertation focus on graphs that have n vertices and e edges and 3-uniform hypergraphs that have n vertices and e edges.

We first observe in the preliminaries chapter that for graphs with a fixed number of vertices and edges there is a threshold graph attaining the …

Analysis Of Discrete Fractional Operators And Discrete Fractional Rheological Models, Meltem Uyanik

Masters Theses & Specialist Projects

This thesis is comprised of two main parts: Monotonicity results on discrete fractional operators and discrete fractional rheological constitutive equations. In the first part of the thesis, we introduce and prove new monotonicity concepts in discrete fractional calculus. In the remainder, we carry previous results about fractional rheological models to the discrete fractional case. The discrete method is expected to provide a better understanding of the concept than the continuous case as this has been the case in the past. In the first chapter, we give brief information about the main results. In the second chapter, we present some fundamental …

Two Rosa-Type Labelings Of Uniform K-Distant Trees And A New Class Of Trees, Kimberly Wenger Diller

Honors Projects

A k-distant tree consists of a main path, called the spine, such that each vertex on the spine is joined by an edge to an end-vertex of at most one path on at most k vertices. Those paths, along with the edge joining them to the spine, are called tails. When every vertex on the spine has exactly one incident tail of length k we call the tree a uniform k-distant tree. We show that every uniform k-distant tree admits both a graceful- and an α-labeling.

For a graph G and a positive integer …

Sandpiles, Spanning Trees, And Plane Duality, Melody Chan, Darren B. Glass, Matthew Macauley, David Perkinson, Caryn Werner, Qiaoyu Yang

Math Faculty Publications

Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et al. used a dynamical process on graphs called rotor-routing to define a simply transitive action of the sandpile group of G on its set of spanning trees. Their definition depends on two pieces of auxiliary data: a choice of a ribbon graph structure on G, and a choice of a root vertex. Chan, Church, and Grochow showed that if G is a planar ribbon graph, it …

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

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).

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

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

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] …

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

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 …

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 …

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.].

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

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

SIUE Faculty Research, Scholarship, and Creative Activity

The $n-dimensional hypercube, or n-cube, is the Cayley graph of the Abelian group Z₂ⁿ. 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

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

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

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

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

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

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

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 CO_Q(V), defined as the direct product of the orthogonal group O_Q(V) with dilations. Utilizing the correspondence between conformal orthogonal group elements and ``decomposable'' elements of the associated Clifford algebra, Cl_Q(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 …