Discrete Mathematics and Combinatorics Commons^™

Billey's Formula In Combinatorics, Geometry, And Topology, Julianna Tymoczko

Mathematics Sciences: Faculty Publications

In this expository paper we describe a powerful combinatorial formula and its implications in geometry, topology, and algebra. This formula first appeared in the appendix of a book by Andersen, Jantzen, and Soergel. Sara Billey discovered it independently five years later, and it played a prominent role in her work to evaluate certain polynomials closely related to Schubert polynomials. Billey's formula relates many pieces of Schubert calculus: the geometry of Schubert varieties, the action of the torus on the flag variety, combinatorial data about permutations, the cohomology of the flag variety and of the Schubert varieties, and the combinatorics of …

Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors bring out how sets in algebraic structure can be used to construct most generalized algebraic structures, like set linear algebra/vector space, set ideals in rings and semigroups. This sort of study is not only innovative but infact very helpful in cases instead of working with a large data we can work with a considerably small data. Thus instead of working with a vector space or a linear algebra V over a field F we can work with a subset in V and a needed subset in F, this can save both time and economy. The concept …

Convex Cones Of Generalized Positive Rational Functions And Nevanlinna-Pick Interpolation, Daniel Alpay, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

Scalar rational functions with a non-negative real part on the right half plane, called positive, are classical in the study of electrical networks, dissipative systems, Nevanlinna-Pick interpolation and other areas. We here study generalized positive functions, i.e with a non-negative real part on the imaginary axis. These functions form a Convex Invertible Cone, cic in short, and we explore two partitionings of this set: (i) into (infinitely many non-invertible) convex cones of functions with prescribed poles and zeroes in the right half plane and (ii) each generalized positive function can be written as a sum of even and odd parts. …

Subset Non Associative Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book for the first time we introduce the notion of subset non associative semirings. It is pertinent to keep on record that study of non associative semirings is meager and books on this specific topic is still rare. Authors have recently introduced the notion of subset algebraic structures. The maximum algebraic structure enjoyed by subsets with two binary operations is just a semifield and semiring, even if a ring or a field is used. In case semigroups or groups are used still the algebraic structure of the subset is only a semigroup. To construct a subset non associative …

Topological Convolution Algebras, Daniel Alpay, Guy Salomon

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we introduce a new family of topological convolution algebras of the form ⋃p∈NL2(S,μp), where S is a Borel semi-group in a locally compact group G, which carries an inequality of the type ∥f∗g∥p≤Ap,q∥f∥q∥g∥p for p>q+d where d pre-assigned, and Ap,q is a constant. We give a sufficient condition on the measures μp for such an inequality to hold. We study the functional calculus and the spectrum of the elements of these algebras, and present two examples, one in the setting of non commutative stochastic distributions, and the other related to Dirichlet series.

On Discrete Analytic Functions: Products, Rational Functions, And Reproducing Kernels, Daniel Alpay, Palle Jorgensen, Ron Seager, Dan Volok

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce a family of discrete analytic functions, called expandable discrete analytic functions, which includes discrete analytic polynomials, and define two products in this family. The first one is defined in a way similar to the Cauchy-Kovalevskaya product of hyperholomorphic functions, and allows us to define rational discrete analytic functions. To define the second product we need a new space of entire functions which is contractively included in the Fock space. We study in this space some counterparts of Schur analysis.

Pontryagin De Branges-Rovnyak Spaces Of Slice Hyperholomorphic Functions, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study reproducing kernel Hilbert and Pontryagin spaces of slice hyperholomorphic functions which are analogs of the Hilbert spaces of analytic functions introduced by de Branges and Rovnyak. In the first part of the paper we focus on the case of Hilbert spaces, and introduce in particular a version of the Hardy space. Then we define Blaschke factors and Blaschke products and we consider an interpolation problem. In the second part of the paper we turn to the case of Pontryagin spaces. We first prove some results from the theory of Pontryagin spaces in the quaternionic setting and, in particular, …

A Generalized White Noise Space Approach To Stochastic Integration For A Class Of Gaussian Stationary Increment Processes, Daniel Alpay, Alon Kipnis

Mathematics, Physics, and Computer Science Faculty Articles and Research

Given a Gaussian stationary increment processes, we show that a Skorokhod-Hitsuda stochastic integral with respect to this process, which obeys the Wick-Itô calculus rules, can be naturally defined using ideas taken from Hida’s white noise space theory. We use the Bochner-Minlos theorem to associate a probability space to the process, and define the counterpart of the S-transform in this space. We then use this transform to define the stochastic integral and prove an associated Itô formula.

Non-Commutative Stochastic Distributions And Applications To Linear Systems Theory, Daniel Alpay, Guy Salomon

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we introduce a non-commutative space of stochastic distributions, which contains the non-commutative white noise space, and forms, together with a natural multiplication, a topological algebra. Special inequalities which hold in this space allow to characterize its invertible elements and to develop an appropriate framework of non-commutative stochastic linear systems.

Representation Formulas For Hardy Space Functions Through The Cuntz Relations And New Interpolation Problems, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz, Itzik Marziano

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce connections between the Cuntz relations and the Hardy space H2 of the open unit disk D. We then use them to solve a new kind of multipoint interpolation problem in H2, where for instance, only a linear combination of the values of a function at given points is preassigned, rather than the values at the points themselves.

Cost Effective Domination In Graphs, Tabitha Lynn Mccoy

Electronic Theses and Dissertations

A set S of vertices in a graph G = (V,E) is a dominating set if every vertex in V \ S is adjacent to at least one vertex in S. A vertex v in a dominating set S is said to be it cost effective if it is adjacent to at least as many vertices in V \ S as it is in S. A dominating set S is cost effective if every vertex in S is cost effective. The minimum cardinality of a cost effective dominating set of G is the cost …

A Bijective Proof Of A Factorization Formula For Specialized Macdonald Polynomials, Nicholas A. Loehr, Elizabeth Niese

Mathematics Faculty Research

Let μ and ν = (ν 1, . . . , ν k ) be partitions such that μ is obtained from ν by adding m parts of sizer. Descouens and Morita proved algebraically that the modified Macdonald polynomials

H~μ(X;q,t)

satisfy the identity

H~μ=H~νH~(r^m)

when the parameter t is specialize to an mth root of unity. Descouens, Morita, and Numata proved this formula bijectively when r ≤ ν k and

r∈{1,2}.

This note gives a bijective proof of the formula for all r ≤ ν k .

K-Total Product Cordial Labelling Of Graphs, R. Ponraj, M. Sundaram, M. Sivakumar

Applications and Applied Mathematics: An International Journal (AAM)

In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investigate the 3-Total Product cordial labelling behaviour of some standard graphs.

Generalizations Of Two Statistics On Linear Tilings, Toufik Mansour, Mark Shattuck

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we study generalizations of two well-known statistics on linear square-and-domino tilings by considering only those dominos whose right half covers a multiple of 􀝇, where 􀝇 is a fixed positive integer. Using the method of generating functions, we derive explicit expressions for the joint distribution polynomials of the two statistics with the statistic that records the number of squares in a tiling. In this way, we obtain two families of q -generalizations of the Fibonacci polynomials. When 􀝇 􀵌 1, our formulas reduce to known results concerning previous statistics. Special attention is payed to the case 􀝇 …

Hamilton Decompositions Of Certain 6-Regular Cayley Graphs On Abelian Groups With A Cyclic Subgroup Of Index Two, Erik E. Westlund

Faculty Articles

Alspach conjectured that every connected Cayley graph of even valency on a finite Abelian group is Hamilton-decomposable. Using some techniques of Liu, this article shows that if A is an Abelian group of even order with a generating set {a,b}, and A contains a subgroup of index two, generated by c, then the 6-regular Cayley graph is Hamilton-decomposable.

Nested (2,R)-Regular Graphs And Their Network Properties., Josh Daniel Brooks

Electronic Theses and Dissertations

A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph G is (2, r)-regular where p, s, and m are positive integers, and m ≥ 2, then when n is sufficiently large, then G is isomorphic to G = K_s+mK_p, where 2(p-1)+s = r. A nested (2,r)-regular graph is constructed by replacing selected cliques with a (2,r)-regular graph and joining the vertices of the peripheral cliques. For …

Global Domination Stable Graphs, Elizabeth Marie Harris

Electronic Theses and Dissertations

A set of vertices S in a graph G is a global dominating set (GDS) of G if S is a dominating set for both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.

A Survey Of Classical And Recent Results In Bin Packing Problem, Yoga Jaideep Darapuneni

UNLV Theses, Dissertations, Professional Papers, and Capstones

In the classical bin packing problem one receives a sequence of n items 1, 2,..., n with sizes s1, s2, . . . ,sn where each item has a fixed size in (0, 1]. One needs to find a partition of the items into sets of size1, called bins, so that the number of sets in the partition is minimized and the sum of the sizes of the pieces assigned to any bin does not exceed its capacity. This combinatorial optimization problem which is NP hard has many variants as well as online and offline versions of the problem. Though …

Generating Minimal T-Wise Test Suites, Luis C. Gutierrez, Carlos Nieto, Francisco Zapata, Martine Ceberio

COURI Symposium Abstracts, Summer 2012

As the use of computing devices increases every day, users rely on the adequate functioning of software. When software is not tested properly, it can yield erroneous information or a complete failure of the system. The NIST estimates that defective software cost the United States economy close to $60 billion a year. Therefore, there is a need to develop software testing techniques that are time and cost effective. Fully testing software under all possible combinations of parameters values cannot be reduced. However, testing can focus on covering all combinations of subsets of parameters and empirical data shows that doing so …

The Weak Discrepancy And Linear Extension Diameter Of Grids And Other Posets, Katherine Victoria Johnson

Department of Mathematics: Dissertations, Theses, and Student Research

A linear extension of a partially ordered set is simply a total ordering of the poset that is consistent with the original ordering. The linear extension diameter is a measure of how different two linear extensions could be, that is, the number of pairs of elements that are ordered differently by the two extensions. In this dissertation, we calculate the linear extension diameter of grids. This also gives us a nice characterization of the linear extensions that are the farthest from each other, and allows us to conclude that grids are diametrally reversing.

A linear extension of a poset might …