相关论文: Rank-Crank type PDE's for higher level Appell func…

This paper surveys and discusses recent work adapting partial differential equation (PDE) models to discrete structures.

We consider a general discrete Sobolev inner product involving the Hahn difference operator, so this includes the well--known difference operators $\mathscr{D}_{q}$ and $\Delta$ and, as a limit case, the derivative operator. The objective…

We prove that any odd-dimensional modular category of rank at most 23 is pointed. We also show that an odd-dimensional modular category of rank 25 is either pointed, perfect, or equivalent to $\operatorname{Rep}(D^\omega(\mathbb Z_7\rtimes…

We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in…

The second order partial difference equation of two variables $ \CD u:= A_{1,1}(x) \Delta_1 \nabla_1 u + A_{1,2}(x) \Delta_1 \nabla_2 u + A_{2,1}(x) \Delta_2 \nabla_1 u + A_{2,2}(x) \Delta_2 \nabla_2 u & \qquad \qquad \qquad \qquad + B_1(x)…

It follows from the Grothendieck-Ogg-Shafarevich formula that the rank of an abelian variety (with trivial trace) defined over the function field of a curve is bounded by a quantity which depends on the genus of the base curve and on bad…

Two analogues of the crank function are defined for overpartitions -- the first residual crank and the second residual crank. This suggests an exploration of crank functions defined for overpartitions whose parts are divisible by an…

We study Appell functions associated to an arbitrary positive definite lattice $\Lambda$ and a choice of $M\leq {\rm dim}(\Lambda)$ linearly independent vectors $d_r\in \Lambda$, $r=1,\dots,M$. These functions are instances of…

Starting from the second Painlev\'{e} equation, we obtain Painlev\'{e} type equations of higher order by using the singular point analysis.

Let $K/\mathbb{Q}$ be an imaginary quadratic extension, and let $p$ be an odd prime. In this paper, we investigate the growth of Mordell-Weil ranks of CM abelian varieties associated with Hecke characters over $K$ of infinite type $(1, 0)$…

In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result,…

A sharp pointwise differential inequality for vectorial second-order partial differential operators, with Uhlenbeck structure, is offered. As a consequence, optimal second-order regularity properties of solutions to nonlinear elliptic…

We introduce certain raising and lowering operators for Macdonald polynomials (of type $A_{n-1}$) by means of Dunkl operators. The raising operators we discuss are a natural $q$-analogue of raising operators for Jack polynomials introduced…

Starting from the elliptic curve $E: y^2 = x^3 - x$ over $\mathbb{F}_9$, a curve $\mathcal{X}$ over $\mathbb{F}_{3^{2n}}$ and a cyclic cover of $\mathcal{X}$ of degree $m \in \{2,3,4,6\}$, we construct the corresponding $m$-twists over the…

We establish certain topological properties of rank understood as a function on the set of invariant measures on a topological dynamical system. To be exact, we show that rank is of Young class LU (i.e., it is the limit of an increasing…

Let $n$ be a positive integer and $q$ be a power of an odd prime. We provide explicit formulas for calculating the orthogonal determinants $\det(\chi)$, where $\chi \in \mathrm{Irr}(\mathrm{GL}_n(q))$ is an orthogonal character of even…

In this paper we find the smallest part function related to the $4$-th symmetrized crank function, corresponding to the one obtained in Patkowski [11] for the $4$-th symmetrized rank function. This provides us with a direct relationship…

Solving high-dimensional partial differential equations (PDEs) is a major challenge in scientific computing. We develop a new numerical method for solving elliptic-type PDEs by adapting the Q-learning algorithm in reinforcement learning.…

Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…

In this article we study the expected rank problem under full information. Our approach uses the planar Poisson approach from Gnedin (2007) to derive the expected rank of a stopping rule that is one of the simplest non-trivial examples…