Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 14 of 14
Full-Text Articles in Physical Sciences and Mathematics
An Injection From Standard Fillings To Parking Functions, Elizabeth Niese
An Injection From Standard Fillings To Parking Functions, Elizabeth Niese
Elizabeth Niese
The Hilbert series of the Garsia-Haiman module can be written as a generating function of standard fillings of Ferrers diagrams. It is conjectured by Haglund and Loehr that the Hilbert series of the diagonal harmonics can be written as a generating function of parking functions. In this paper we present a weight-preserving injection from standard fillings to parking functions for certain cases.
Composite Fermions And Integer Partitions, Arthur Benjamin, Jennifer Quinn, John Quinn, Arkadiusz Wojs
Composite Fermions And Integer Partitions, Arthur Benjamin, Jennifer Quinn, John Quinn, Arkadiusz Wojs
Jennifer J. Quinn
We utilize the KOH theorem to prove the unimodality of integer partitions with at most a parts, all parts less than or equal to b, that are required to contain either repeated or consecutive parts. We connect this result to an open question in quantum physics relating the number of distinct total angular momentum multiplets of a system of N fermions, each with angular momentum ℓ, to those of a system in which each Fermion has angular momentum ℓ*=ℓ−N+1.
Strong Chromatic Index Of Subset Graphs, Jennifer Quinn, Arthur Benjamin
Strong Chromatic Index Of Subset Graphs, Jennifer Quinn, Arthur Benjamin
Jennifer J. Quinn
The strong chromatic index of a graph G, denoted sq(G), is the minimum number of parts needed to partition the edges of G into induced matchings. For 0 ≤ k ≤ l ≤ m, the subset graph Sm(k, l) is a bipartite graph whose vertices are the k- and l-subsets of an m element ground set where two vertices are adjacent if and only if one subset is contained in the other. We show that sq(Sm(k, l) ) = m choose l-k and that this number satisfies the strong chromatic index conjecture by Brualdi and Quinn for bipartite graphs. Further, …
Decision Diagrams And Dynamic Programming, John Hooker
Decision Diagrams And Dynamic Programming, John Hooker
John Hooker
No abstract provided.
Mixed Integer Programming Vs Logic-Based Benders Decomposition For Planning And Scheduling, John Hooker, Andre Cire
Mixed Integer Programming Vs Logic-Based Benders Decomposition For Planning And Scheduling, John Hooker, Andre Cire
John Hooker
No abstract provided.
Integrated Methods For Optimization, 2nd Ed, John Hooker
Integrated Methods For Optimization, 2nd Ed, John Hooker
John Hooker
No abstract provided.
Toward Unification Of Exact And Heuristic Optimization Methods, John Hooker
Toward Unification Of Exact And Heuristic Optimization Methods, John Hooker
John Hooker
No abstract provided.
Business Ethics As Rational Choice, John Hooker
Constraint Programming, John Hooker
Working Across Cultures, John Hooker
Logic, Optimization And Constraint Programming, John Hooker
Logic, Optimization And Constraint Programming, John Hooker
John Hooker
No abstract provided.
Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker
Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker
John Hooker
No abstract provided.
Optimization Methods For Logical Inference, Vijay Chandru, John Hooker
Optimization Methods For Logical Inference, Vijay Chandru, John Hooker
John Hooker
No abstract provided.
Constraint Satisfaction Methods For Generating Valid Cuts, John Hooker
Constraint Satisfaction Methods For Generating Valid Cuts, John Hooker
John Hooker
No abstract provided.