The notion of central stability was first formulated for sequences of representations of the symmetric groups by Putman. A categorical reformulation was subsequently given by Church, Ellenberg, Farb, and Nagpal using the notion of FI-modules, where FI is the category of finite sets and injective maps. We extend the notion of central stability from FI to a wide class of categories, and prove that a module is presented in finite degrees if and only if it is centrally stable. We also introduce the notion of d-step central stability, and prove that if the ideal of relations of a category is generated in degrees at most d, then every module presented in finite degrees is d-step centrally stable.

This paper studies affine Deligne-Lusztig varieties $X_{w}(b)$ in the affine flag variety of a quasi-split tamely ramified group. We describe the geometric structure of $X_{w}(b)$ for a minimal length element $w$ in the conjugacy class of an extended affine Weyl group, generalizing one of the main results in \cite{HL} to the affine case. We then provide a reduction method that relates the structure of $X_{w}(b)$ for arbitrary elements $w$ in the extended affine Weyl group to those associated with minimal length elements. Based on this reduction, we establish a connection between the dimension of affine Deligne-Lusztig varieties and the degree of the class polynomial of affine Hecke algebras. As a consequence, we prove a conjecture of G\"ortz, Haines, Kottwitz and Reuman in \cite{GHKR}.

A vast class of exponential functions are shown to be deterministic. This class includes functions whose exponents are polynomial-like or ``piece-wise'' close to polynomials after differentiation. Many of these functions are proved to be disjoint from the M\"obius function.

In this paper, we try to clarify some of the questions related to a key concept in multivariate polynomial solving algorithm over a finite field: the degree of regularity. By the degree of regularity, here we refer to a concept first presented by Dubois and Gama, namely the lowest degree at which certain nontrivial degree drop of a polynomial system occurs. Currently, it is somehow commonly accepted that we can use this degree to estimate the complexity of solving a polynomial system, even though we do not have systematic empirical data or a theory to support such a claim. In this paper, we would like to clarify the situation with the help of experiments. We first define a concept of solving degree for a polynomial system. The key question we then need to clarify is the connection of solving degree and the degree of regularity with focus on quadratic systems. To exclude the cases that do not represent the general situation, we need to define when a system is degenerate and when it is irreducible. With extensive computer experiments, we show that the two concepts, the degree of regularity and the solving degree, are related for irreducible systems in the sense that the difference between the two degrees is indeed small, less than 3. But due to the limitation of our experiments, we speculate that this may not be the case for high degree cases.

Our main result gives necessary and sufficient conditions, in terms of Fourier transforms, for an ideal in the convolution algebra of spherical integrable functions on the (conformal) automorphism group of the unit disk to be dense, or to have as closure the closed ideal of functions with integral zero. This is then used to prove a generalization of Furstenberg's theorem, which characterizes harmonic functions on the unit disk by a mean value property, and a “two circles” Morera type theorem (earlier announced by Agranovskii).