Related papers: Notes on Low Degree L-Data

In this paper, we define the p-adic Euler L-functions using the fermionic p-adic integral on Zp. By computing the values of the p-adic Euler L-functions at negative integers, we show that for Dirichlet characters with odd conductor, this…

Large pre-trained transformer-based language models have achieved impressive results on a wide range of NLP tasks. In the past few years, Knowledge Distillation(KD) has become a popular paradigm to compress a computationally expensive model…

We classify group gradings on the simple Lie algebra $L$ of type $D_4$ over an algebraically closed field of characteristic different from 2: fine gradings up to equivalence and $G$-gradings, with a fixed group $G$, up to isomorphism. For…

We study the behaviour of automorphic L-Invariants associated to cuspidal representations of GL(2) of cohomological weight 0 under abelian base change and Jacquet-Langlands lifts to totally definite quaternion algebras. Under a standard…

We prove that every bounded function $f:\{-1,1\}^n\to[-1,1]$ of degree at most $d$ can be learned with $L_2$-accuracy $\varepsilon$ and confidence $1-\delta$ from $\log(\tfrac{n}{\delta})\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}}$ random…

Let K be an algebraic number field. For a degree d rational morphism of projective n-space defined over K let R denote its minimal resultant ideal. For a fixed height function on the moduli space of dynamical systems this paper shows that…

For finite sequence $\underbar{\em d}$ of positive integers, we consider graphs that have $\underbar{\em d}$ as their list of vertex degrees, and bipartite graphs for which each part has $\underbar{\em d}$ as its list of vertex degrees. In…

Functional depth is used for ranking functional observations from most outlying to most typical. The ranks produced by functional depth have been proposed as the basis for functional classifiers, rank tests, and data visualization…

We consider versal deformations of 0|3-dimensional L-infinity algebras, which correspond precisely to ordinary (non-graded) three dimensional Lie algebras. The classification of such algebras over C is well known, although we shall give a…

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…

These notes are based on the three lectures that one of the authors gave at Tsinghua University in the summer of 2023 as part of the workshop on Geometric Representation Theory and Applications. They contain an introduction to the…

The thesis gave a fine study on the distribution of the coefficients of automorphic L-functions for GL(m) with m>1. In particular we have treated two types of problems: change of signs of these coefficients (when they are real) and their…

The pseudo-inverse of a graph Laplacian matrix, denoted as $L^\dagger$, finds extensive application in various graph analysis tasks. Notable examples include the calculation of electrical closeness centrality, determination of Kemeny's…

We investigate the filtration corresponding to the degree function induced by a non-zero locally nilpotent derivation and its associated graded algebra. We show that this kind of filtration, referred to as the LND-filtration, is the ideal…

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

We study structural properties of graphs with fixed clique number and high minimum degree. In particular, we show that there exists a function $L=L(r,\varepsilon)$, such that every $K_r$-free graph $G$ on $n$ vertices with minimum degree at…

We prove a new (conditional) result towards the subconvexity problem for certain automorphic $L$-functions for $\mathrm{GL}_2 \times \mathrm{GL}_3$. This follows from the computation of new $\mathrm{SL}_2$-period integrals associated with…

Data augmentation is a widely used technique and an essential ingredient in the recent advance in self-supervised representation learning. By preserving the similarity between augmented data, the resulting data representation can improve…

We consider the following basic, and very broad, statistical problem: Given a known high-dimensional distribution ${\cal D}$ over $\mathbb{R}^n$ and a collection of data points in $\mathbb{R}^n$, distinguish between the two possibilities…