AbstractThis is the first of a series of papers where we develop a theory of total positivity for loop groups. In this paper, we completely describe the totally nonnegative part of the polynomial loop group GLn(R[t,t−1]), and for the formal loop group GLn(R((t))) we describe the totally nonnegative points which are not totally positive. Furthermore, we make the connection with networks on the cylinder.Our approach involves the introduction of distinguished generators, called whirls and curls, and we describe the commutation relations amongst them. These matrices play the same role as the poles and zeros of the Edrei–Thoma theorem classifying totally positive functions (corresponding to our case n=1). We give a solution to the “factorization...
Thesis (M.S.) University of Alaska Fairbanks, 2017Slurried pile foundations installed in predrilled ...
Parallel complexity theory is currently one of the fastest growing fields of theoretical computer sc...
Thesis (M.S.) University of Alaska Fairbanks, 2011The Kronecker-Weber Theorem is a, classification r...
AbstractIn this paper, we prove the existence of isomorphisms between certain non-commutative algebr...
AbstractWe introduce the notion of an arithmetic matroid whose main example is a list of elements of...
AbstractThe Yokonuma–Hecke algebras are quotients of the modular framed braid group and they support...
AbstractWe study the basic ergodic properties (ergodicity and conservativity) of the action of an ar...
AbstractWe study connections between the topology of generic character varieties of fundamental grou...
The thesis is essentially concerned with two subjects corresponding to the two grants under which th...
We approach several themes of classical geometry of the circle and complete them with some original ...
2010 Summer.Includes bibliographic references.Covers not scanned.Print version deaccessioned 2022.Th...
AbstractWe consider BPS states in a large class of d=4, N=2 field theories, obtained by reducing six...
AbstractThe Gelfand–Tsetlin graph is an infinite graded graph that encodes branching of irreducible ...
The body of the paper is divided into three parts: Part one: include definitions and examples of the...
In Chapter 1, we follow P. Feehan’s iterated conformal blow-ups method, to check that neighbourhoods...
Thesis (M.S.) University of Alaska Fairbanks, 2017Slurried pile foundations installed in predrilled ...
Parallel complexity theory is currently one of the fastest growing fields of theoretical computer sc...
Thesis (M.S.) University of Alaska Fairbanks, 2011The Kronecker-Weber Theorem is a, classification r...
AbstractIn this paper, we prove the existence of isomorphisms between certain non-commutative algebr...
AbstractWe introduce the notion of an arithmetic matroid whose main example is a list of elements of...
AbstractThe Yokonuma–Hecke algebras are quotients of the modular framed braid group and they support...
AbstractWe study the basic ergodic properties (ergodicity and conservativity) of the action of an ar...
AbstractWe study connections between the topology of generic character varieties of fundamental grou...
The thesis is essentially concerned with two subjects corresponding to the two grants under which th...
We approach several themes of classical geometry of the circle and complete them with some original ...
2010 Summer.Includes bibliographic references.Covers not scanned.Print version deaccessioned 2022.Th...
AbstractWe consider BPS states in a large class of d=4, N=2 field theories, obtained by reducing six...
AbstractThe Gelfand–Tsetlin graph is an infinite graded graph that encodes branching of irreducible ...
The body of the paper is divided into three parts: Part one: include definitions and examples of the...
In Chapter 1, we follow P. Feehan’s iterated conformal blow-ups method, to check that neighbourhoods...
Thesis (M.S.) University of Alaska Fairbanks, 2017Slurried pile foundations installed in predrilled ...
Parallel complexity theory is currently one of the fastest growing fields of theoretical computer sc...
Thesis (M.S.) University of Alaska Fairbanks, 2011The Kronecker-Weber Theorem is a, classification r...