Algebra Commons^™

A Generalized Polynomial Identity Arising From Quantum Mechanics, Shashikant B. Mulay, John J. Quinn, Mark A. Shattuck

Applications and Applied Mathematics: An International Journal (AAM)

We establish a general identity that expresses a Pfaffian of a certain matrix as a quotient of homogeneous polynomials. This identity arises in the study of weakly interacting many-body systems and its proof provides another way of realizing the equivalence of two proposed types of trial wave functions used to describe such systems. In the proof of our identity, we make use of only elementary linear algebra and combinatorics and thereby avoid use of more advanced conformal field theory in establishing the aforementioned equivalence.

Cycle Structures Of Orthomorphisms Extending Partial Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski, John S. Caughman Iv

Mathematics and Statistics Faculty Publications and Presentations

A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G such that π(x)−x ≠ π(y) for all distinct x,y∈S. We refer to |S| as the size of π, and if S=G, then π is an orthomorphism. Despite receiving a fair amount of attention in the research literature, many basic questions remain concerning the number of orthomorphisms of a given group, and what cycle types these permutations have.

It is known that conjugation by automorphisms of G forms a group action on the set of orthomorphisms of G. In this paper, we consider the …

Impartial Avoidance And Achievement Games For Generating Symmetric And Alternating Groups, Bret J. Benesh, Dana C. Ernst, Nándor Sieben

Mathematics Faculty Publications

Anderson and Harary introduced two impartial games on finite groups. Both games are played by two players who alternately select previously unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. We determine the nim-numbers, and therefore the outcomes, of these games for symmetric and alternating groups.

Math And Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, And Combinatorics, Kyle Oddson

Student Research Symposium

Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem [1] regarding the associated partial chromatic polynomial [5]; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards.

Impartial Avoidance Games For Generating Finite Groups, Bret J. Benesh, Dana C. Ernst, Nándor Sieben

Mathematics Faculty Publications

We study an impartial avoidance game introduced by Anderson and Harary. The game is played by two players who alternately select previously unselected elements of a finite group. The first player who cannot select an element without making the set of jointly-selected elements into a generating set for the group loses the game. We develop criteria on the maximal subgroups that determine the nim-numbers of these games and use our criteria to study our game for several families of groups, including nilpotent, sporadic, and symmetric groups.

Zeon Roots, Lisa M. Dollar, G. Stacey Staples

SIUE Faculty Research, Scholarship, and Creative Activity

Zeon algebras can be thought of as commutative analogues of fermion algebras, and they can be constructed as subalgebras within Clifford algebras of appropriate signature. Their inherent combinatorial properties make them useful for applications in graph enumeration problems and evaluating functions defined on partitions. In this paper, kth roots of invertible zeon elements are considered. More specifically, conditions for existence of roots are established, numbers of existing roots are determined, and computational methods for constructing roots are developed. Recursive and closed formulas are presented, and specific low-dimensional examples are computed with Mathematica. Interestingly, Stirling numbers of the first kind appear …

Zeons, Orthozeons, And Graph Colorings, G. Stacey Staples, Tiffany Stellhorn

SIUE Faculty Research, Scholarship, and Creative Activity

No abstract provided.

Graph Cohomology, Matthew Lin

HMC Senior Theses

What is the cohomology of a graph? Cohomology is a topological invariant and encodes such information as genus and euler characteristic. Graphs are combinatorial objects which may not a priori admit a natural and isomorphism invariant cohomology ring. In this project, given any finite graph G, we constructively define a cohomology ring H*(G) of G. Our method uses graph associahedra and toric varieties. Given a graph, there is a canonically associated convex polytope, called the graph associahedron, constructed from G. In turn, a convex polytope uniquely determines a toric variety. We synthesize these results, and describe the …

Realizing The 2-Associahedron, Patrick N. Tierney

HMC Senior Theses

The associahedron has appeared in numerous contexts throughout the field of mathematics. By representing the associahedron as a poset of tubings, Michael Carr and Satyan L. Devadoss were able to create a gener- alized version of the associahedron in the graph-associahedron. We seek to create an alternative generalization of the associahedron by considering a particle-collision model. By extending this model to what we dub the 2- associahedron, we seek to further understand the space of generalizations of the associahedron.

The Diameter Of A Rouquier Block, Andrew Mayer

Williams Honors College, Honors Research Projects

For my Honors Research Project, I will be researching special properties of Rouquier blocks that represent the partitions of integers. This problem is motivated by ongoing work in representation theory of the symmetric group. For each integer n and each prime p, there is an object called a Rouquier block; this block can be visualized as a collection of points in a plane, each corresponding to a partition. In this group of points, we say a pair of points is “connected” if certain conditions on the partitions are met. We compare each partition with each other partition, add edges when …

Lose Big, Win Big, Sum Big: An Exploration Of Ranked Voting Systems, Erin Else Stuckenbruck

Senior Projects Spring 2016

Senior Project submitted to The Division of Science, Mathematics and Computing of Bard College.

Mod Natural Neutrosophic Subset Semigroups, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of MOD subsets using Zn ... On these MOD subsets the operation ‘+’ is defined, S(Zn) denotes the MOD subset and {S(Zn), +} happens to be only a Smarandache semigroup.

These S-semigroups enjoy several interesting properties. The notion of MOD universal subset and MOD absorbing subsets are defined and developed. {S(Zn), x } is also a semigroup and several properties associated with them are derived. MOD natural neutrosophic subsets forms only a semigroup under ‘+’. In fact the main feature enjoyed by this structure is they have subset idempotents …

Mod Graphs, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

Zadeh introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. Atanassov introduced the degree of nonmembership/ falsehood (f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of indeterminacy/ neutrality (i) as independent component in 1995 (published in 1998) and defined the neutrosophic set on three components (t, i, f) = (truth, indeterminacy, falsehood): http://fs.gallup.unm.edu/FlorentinSmarandache.htm Etymology. The words “neutrosophy” and “neutrosophic” were coined/ invented by F. Smarandache in his 1998 book. Neutrosophy: A branch of philosophy, introduced by F. Smarandache in 1980, which studies the origin, nature, and scope of neutralities, as well …

Semigroups On Mod Natural Neutrosophic Elements, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the notion of semigroups under + is constructed using the Mod natural neutrosophic integers or MOD natural neutrosophic-neutrosophic numbers or mod natural neutrosophic finite complex modulo integer or MOD natural neutrosophic dual number integers or MOD natural neutrosophic special dual like number or MOD natural neutrosophic special quasi dual numbers are analysed in a systematic way. All these semigroups under + have an idempotent subsemigroup under +. This is the first time we are able to give a class of idempotent subsemigroups under + by taking only those MOD natural neutrosophic elements

Special Type Of Fixed Point Pairs Using Mod Rectangular Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time define a special type of fixed points using MOD rectangular matrices as operators. In this case the special fixed points or limit cycles are pairs which is arrived after a finite number of iterations. Such study is both new and innovative for it can find lots of applications in mathematical modeling. Since all these Zn or I nZ or 〈Zn ∪ g〉 or 〈Zn ∪ g〉I or C(Zn) or CI(Zn) are all of finite order we are sure to arrive at a MOD fixed point pair or a MOD limit cycle pair …

Neutrosophic Set Approach To Algebraic Structures, Florentin Smarandache, Madad Khan, Fazal Tahir

Branch Mathematics and Statistics Faculty and Staff Publications

Real world is featured with complex phenomenons. As uncertainty is inevitably involved in problems arise in various elds of life and classical methods failed to handle these type of problems. Dealing with imprecise, uncertain or imperfect information was a big task for many years. Many modelswerepresentedinordertoproperlyincorporateuncertaintyintosystem description, LotA.Zadeh in 1965 introduced the idea of a fuzzy set. Zadeh replaced conventional characteristic function of classical crisp sets which takes on its values in f0;1g by membership function which takes on its values in closed interval [0;1]. Fuzzy set theory is conceptually a very powerful technique to deal with another aspect or …

Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic graph are obtained. Several open conjectures are proposed. These new class of strong neutrosophic graphs will certainly find applications in NCMs, NRMs and NREs with appropriate modifications.

Special Type Of Fixed Points Of Mod Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce a special type of fixed points using MOD square matrix operators. These special type of fixed points are different from the usual classical fixed points. A study of this is carried out in this book. Several interesting properties are developed in this regard. The notion of these fixed points find many applications in the mathematical models which are dealt systematically by the authors in the forth coming books. These special type of fixed points or special realized limit cycles are always guaranteed as we use only MOD matrices as operators with …

Mod Relational Maps Models And Mod Natural Neutrosophic Relational Maps Models, Florentin Smarandache, K. Ilanthenral, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Zadeh introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. Atanassov introduced the degree of non membership/falsehood (f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of indeterminacy/neutrality (i) as independent component in 1995 (published in 1998) and defined the neutrosophic set on three components (t,i,f) = (truth, indeterminacy, falsehood). The words “neutrosophy” and “neutrosophic” were coined/invented by F. Smarandache in his 1998 book. Etymologically, “neutro-sophy” (noun) [French neutre 1), or complete information (sum of components = 1).

Mod Cognitive Maps Models And Mod Natural Neutrosophic Cognitive Maps Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

Zadeh introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. Atanassov introduced the degree of non membership/falsehood (f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of indeterminacy/neutrality (i) as independent component in 1995 (published in 1998) and defined the neutrosophic set on three components (t,i,f) = (truth, indeterminacy, falsehood). The words “neutrosophy” and “neutrosophic” were coined/invented by F. Smarandache in his 1998 book. Etymologically, “neutro-sophy” (noun) [French neutre 1), or complete information (sum of components = 1).

Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this first books of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …

Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this second book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …

Polytopes Of Large Rank For Psl(4,Q), Peter A. Brooksbank, Dimitri Leemans

Faculty Journal Articles

This paper examines abstract regular polytopes whose automorphism group is the projective special linear group PSL(4,q). For q odd we show that polytopes of rank 4 exist by explicitly constructing PSL(4,q) as a string C-group of that rank. On the other hand, we show that no abstract regular polytope exists whose group of automorphisms is PSL(4,2^k).

The Spectral Theorem For Quaternionic Unbounded Normal Operators Based On The S-Spectrum, Daniel Alpay, Fabrizio Colombo, David P. Kimsey

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we prove the spectral theorem for quaternionic unbounded normal operators using the notion of S-spectrum. The proof technique consists of first establishing a spectral theorem for quaternionic bounded normal operators and then using a transformation which maps a quaternionic unbounded normal operator to a quaternionic bounded normal operator. With this paper we complete the foundation of spectral analysis of quaternionic operators. The S-spectrum has been introduced to define the quaternionic functional calculus but it turns out to be the correct object also for the spectral theorem for quaternionic normal operators. The fact that the correct notion of …

Characterizations Of Rectangular (Para)-Unitary Rational Functions, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

We here present three characterizations of not necessarily causal, rational functions which are (co)-isometric on the unit circle:
(i) through the realization matrix of Schur stable systems,
(ii) the Blaschke-Potapov product, which is then employed to introduce an easy-to-use description of all these functions with dimensions and McMillan degree as parameters,
(iii) through the (not necessarily reducible) Matrix Fraction Description (MFD).
In cases (ii) and (iii) the poles of the rational functions involved may be anywhere in the complex plane, but the unit circle (including both zero and infinity). A special attention is devoted to exploring the gap between the …

The H∞ Functional Calculus Based On The S-Spectrum For Quaternionic Operators And For N-Tuples Of Noncommuting Operators, Daniel Alpay, Fabrizio Colombo, Tao Qian, Irene Sabadini, Tao Qian

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we extend the H∞ functional calculus to quaternionic operators and to n-tuples of noncommuting operators using the theory of slice hyperholomorphic functions and the associated functional calculus, called S-functional calculus. The S-functional calculus has two versions one for quaternionic-valued functions and one for Clifford algebra-valued functions and can be considered the Riesz-Dunford functional calculus based on slice hyperholomorphicity because it shares with it the most important properties.

The S-functional calculus is based on the notion of S-spectrum which, in the case of quaternionic normal operators on a Hilbert space, is also the notion of spectrum that appears …

Wiener Algebra For The Quaternions, Daniel Alpay, Fabrizio Colombo, David P. Kimsey, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We define and study the counterpart of the Wiener algebra in the quaternionic setting, both for the discrete and continuous case. We prove a Wiener-Lévy type theorem and a factorization theorem. We give applications to Toeplitz and Wiener-Hopf operators.

The Spectral Theorem For Unitary Operators Based On The S-Spectrum, Daniel Alpay, Fabrizio Colombo, David P. Kimsey, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

The quaternionic spectral theorem has already been considered in the literature, see e.g. [22], [31], [32], however, except for the finite dimensional case in which the notion of spectrum is associated to an eigenvalue problem, see [21], it is not specified which notion of spectrum underlies the theorem.

In this paper we prove the quaternionic spectral theorem for unitary operators using the S-spectrum. In the case of quaternionic matrices, the S-spectrum coincides with the right-spectrum and so our result recovers the well known theorem for matrices. The notion of S-spectrum is relatively new, see [17], and has been used for …

A New Realization Of Rational Functions, With Applications To Linear Combination Interpolation, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz, Dan Volok

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce the following linear combination interpolation problem (LCI): Given N distinct numbers w1,…wN and N+1 complex numbers a1,…,aN and c, find all functions f(z) analytic in a simply connected set (depending on f) containing the points w1,…,wN such that ∑u=1Nauf(wu)=c. To this end we prove a representation theorem for such functions f in terms of an associated polynomial p(z). We first introduce the following two operations, (i) substitution of p, and (ii) multiplication by monomials zj,0≤j

The Automorphism Group Of The Halved Cube, Benjamin B. Mackinnon

Theses and Dissertations

An n-dimensional halved cube is a graph whose vertices are the binary strings of length n, where two vertices are adjacent if and only if they differ in exactly two positions. It can be regarded as the graph whose vertex set is one partite set of the n-dimensional hypercube, with an edge joining vertices at hamming distance two. In this thesis we compute the automorphism groups of the halved cubes by embedding them in R n and realizing the automorphism group as a subgroup of GLn(R). As an application we show that a halved cube is a circulant graph if …