Past Events

In this talk, we consider the non-penalty shrinkage and pretest estimation methods for the regression parameters of the generalized log-logistic proportional hazards (PH) model. This model, a simple extension of the log-logistic model (which...

David Vogan's 1993 paper on the local Langlands correspondence showed that there are advantages to simultaneously considering representations of a p-adic group together with its pure inner forms. Combined with other insights, this opened the door to...

In practice, L-functions appear as generating functions encapsulating information about various objects, such as Galois representations, elliptic curves, arithmetic functions, modular forms, Maass forms, etc. Studying L-functions is therefore of...

Let G = (V, E) be a simple graph of order n. The adjacency matrix of G is denoted by A(G) = [a_ij], where a_ij=1 if {v_i ,v_j} ∈ E and a_ij=0, otherwise. The diagonal matrix of degrees of G, D(G) = [d_ij], is defined by d_ii=d(v_i), and d_ij=0, ∀ i...

Bregman proximal-type algorithms, such as mirror descent, are popular in optimization and data science for effectively exploiting problem structures and optimizing them under tailored geometries. However, most of existing convergence results rely on...

Automorphic representations, which provide a vast generalization of modular forms, are are grouped together into so-called L-packets according to the L-functions they produce. From this point of view, automorphic representations give a kind of fine...

Grothendieck's duality theory relies on the notion of a dualizing complex. In the non-commutative setting such dualizing complexes were studied in the 90s beginning with work by Yekutieli. Since these complexes are not unique (for example, one can...

A classical question in extremal (hyper)graph theory asks for tight minimum degree conditions which force the existence of certain spanning structures in large graphs, generalising Dirac's theorem from 1952. One aspect of this concerns tiling graphs...

An (m, n)-mixed graph consists of a set of vertices, any two of which may be joined by either an edge of one of m colours or an arc of one of n colours, or not be joined at all. The operation of switching at a vertex v of an (m, n)-mixed graph with...

The quadratically regularized optimal transport problem (QOT) has emerged in the literature as a sparse alternative to entropic regularization (EOT). Unlike EOT, whose solutions always have full support—even for small regularization parameters—QOT...