Related papers: Rank-Crank type PDEs and generalized Lambert serie…

In this paper, we obtain bounds for the Mordell-Weil ranks over cyclotomic extensions of a wide range of abelian varieties defined over a number field $F$ whose primes above $p$ are totally ramified over $F/\mathbb{Q}$. We assume that the…

In the previous work, Lim and the author determined the rank variety of the simple $\mathbb{F}\mathfrak{S}_{kp}$-module $D(p-1)=D^{(kp-p+1,1^{p-1})}$ with respect to some maximal elementary abelian $p$-subgroup $E_k$ and the complexity when…

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

This is the final version of ANT-0142 ("An embedding approach to Dwork's conjecture"). It reduces the higher rank case of the conjecture over a general base variety to the rank one case over the affine space. The general rank one case is…

Learning-to-rank (LTR) is a class of supervised learning techniques that apply to ranking problems dealing with a large number of features. The popularity and widespread application of LTR models in prioritizing information in a variety of…

Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…

We prove an algebraicity result for the central critical value of certain Rankin-Selberg L-functions for GL(n) x GL(n-1). This is a generalization and refinement of some results of Harder, Kazhdan-Mazur-Schmidt, Mahnkopf, and…

Multiranks and new rank/crank analogs for a variety of partitions are given, so as to imply combinatorially some arithmetic properties enjoyed by these types of partitions. Our methods are elementary relying entirely on the three classical…

This paper is devoted to study the approximation properties and rate of approximation of the Szasz-Mirakjan-Kantrovich-Stancu type polynomials generated by the Dunkl generalization of the exponential function with respect to q -calculus. We…

Given a rational elliptic surface over a number field, we study the collection of fibers whose Mordell--Weil rank is greater than the generic rank. We give conditions on the singular fibers to assure that the collection of fibers for which…

We introduce various notions of rank for a symmetric tensor, namely: rank, border rank, catalecticant rank, generalized rank, scheme length, border scheme length, extension rank and smoothable rank. We analyze the stratification induced by…

Choice behavior and preferences typically involve numerous and subjective aspects that are difficult to be identified and quantified. For this reason, their exploration is frequently conducted through the collection of ordinal evidence in…

In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor…

We define two-parameter generalizations of two combinatorial constructions of Andrews: the kth symmetrized rank moment and the k-marked Durfee symbol. We prove that three specializations of the associated generating functions are so-called…

Let $\mathcal{X}$ be a Riemann surface of genus $g>0$ defined over a number field $K$ which is a degree $d$-covering of $\mathbb{P}^1_K$. In this paper we show the existence of infinitely many linearly disjoint degree $d$-extensions $L/K$…

An autoregressive-moving average model in which all roots of the autoregressive polynomial are reciprocals of roots of the moving average polynomial and vice versa is called an all-pass time series model. All-pass models are useful for…

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

We prove a family of $n$-th order identities for quantum $R$-matrices of Baxter-Belavin type in fundamental representation. The set of identities includes the unitarity condition as the simplest one ($n=2$). Our study is inspired by the…

We obtain an irreducibility criterion for generalized principal series, extending known and frequently employed results for principal series. Our approach rests on a newly observed semi-direct product decomposition of the relative Weyl…

Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic…