English
Related papers

Related papers: Determinant of $\mathbb F_p$-hypergeometric soluti…

200 papers

We compute the determinant of the Gram matrix of the Shapovalov form on weight spaces of the basic representation of an affine Kac-Moody algebra of ADE type (possibly twisted). As a consequence, we obtain explicit formulae for the…

Representation Theory · Mathematics 2007-05-23 Jonathan Brundan , Alexander Kleshchev

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…

Algebraic Geometry · Mathematics 2011-08-23 Tim Netzer , Daniel Plaumann , Andreas Thom

This paper introduces a $p$-adic analogue of Gauss's hypergeometric function, constructed via a method that is distinct from distinct from Dwork's approach. The idea of our construction is motivated by the Ohno-Zagier formula, which is…

Number Theory · Mathematics 2025-09-24 Hidekazu Furusho

We study positive supersolutions to an elliptic equation $(*)$: $-\Delta u=c|x|^{-s}u^p$, $p,s\in\bf R$ in cone-like domains in $\bf R^N$ ($N\ge 2$). We prove that in the sublinear case $p<1$ there exists a critical exponent $p_*<1$ such…

Analysis of PDEs · Mathematics 2018-07-31 Vladimir Kondratiev , Vitali Liskevich , Vitaly Moroz , Zeev Sobol

For two meromorphic functions $ f $ and $ g $, the equation $ f^m+g^m=1 $ can be regarded as Fermat-type equations. Using Nevanlinna theory for meromorphic functions in several complex variables, the main purpose of this paper is to…

Complex Variables · Mathematics 2022-01-26 Goutam Haldar

We introduce a new concept of solution to the KPZ equation which is shown to extend the classical Cole-Hopf solution. This notion provides a factorisation of the Cole-Hopf solution map into a "universal" measurable map from the probability…

Probability · Mathematics 2015-03-19 Martin Hairer

Given a matrix $A$ and $k\geq 0$, we study the problem of finding the $k\times k$ submatrix of $A$ with the maximum determinant in absolute value. This problem is motivated by the question of computing the determinant-based lower bound of…

Data Structures and Algorithms · Computer Science 2021-09-16 Nima Anari , Thuy-Duong Vuong

We analyse a class of nonoverlapping domain decomposition preconditioners for nonsymmetric linear systems arising from discontinuous Galerkin finite element approximation of fully nonlinear Hamilton--Jacobi--Bellman (HJB) partial…

Numerical Analysis · Mathematics 2024-12-06 Iain Smears

We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…

Mathematical Physics · Physics 2015-04-09 Oksana Bihun , Francesco Calogero

In this article, we study the growth of solutions of the homogeneous complex linear differential equation \begin{equation*} f^{(k)}+A_{k-1}(z)f^{(k-1)}+\cdots+A_{1}(z)f^{\prime}+ A_{0}(z)f=0, \end{equation*}% where the coefficients…

Complex Variables · Mathematics 2024-03-25 Abdelkader Dahmani , Benharrat Belaïdi

The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…

Algebraic Geometry · Mathematics 2025-10-16 Luke Oeding

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

Mathematical Physics · Physics 2015-10-14 Rencai Lu , Kaiming Zhao

Let $A$ be an integral domain with quotient field $K$ of characteristic $0$ that is finitely generated as a $\mathbb{Z}$-algebra. Denote by $D(F)$ the discriminant of a polynomial $F\in A[X]$. Further, given a finite etale algebra $\Omega$,…

Number Theory · Mathematics 2023-09-19 Jan-Hendrik Evertse , Kálmán Györy

For each odd prime $p$, let $\zeta_p$ denote a primitive $p$-th root of unity. In this paper, we study the determinants of some matrices with cyclotomic unit entries. For instance, we show that when $p\equiv 3\pmod4$ and $p>3$ the…

Number Theory · Mathematics 2019-04-15 Hai-Liang Wu

Let $(f\_1,\dots, f\_s) \in \mathbb{Q}\_p [X\_1,\dots, X\_n]^s$ be a sequence of homogeneous polynomials with $p$-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since $\mathbb{Q}\_p$ is not an effective…

Symbolic Computation · Computer Science 2015-09-28 Tristan Vaccon

We consider the q-Painlev\'e equation of type $A_4^{(1)}$ (a version of q-Painlev\'e V equation) and construct a family of solutions expressible in terms of certain basic hypergeometric series. We also present the determinant formula for…

Exactly Solvable and Integrable Systems · Physics 2009-11-13 Taro Hamamoto , Kenji Kajiwara

Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…

Symbolic Computation · Computer Science 2014-05-26 Pierre-Jean Spaenlehauer

We present a complete algorithm that computes all hypergeometric solutions of homogeneous linear difference equations and rational solutions of parameterized linear difference equations in the setting of $\Pi\Sigma^*$-fields. More…

Symbolic Computation · Computer Science 2021-01-27 Sergei A. Abramov , Manuel Bronstein , Marko Petkovšek , Carsten Schneider

Let $ n\geq 2, A=(a_{ij})_{i,j=1}^{n}$ be a real symmetric matrix, $a=(a_i)_{i=1}^{n}\in \Bbb R^n.$ Consider the differential operator $D_A = \sum_{i,j=1}^n a_{ij}{\partial^2 \over \partial x_i \partial x_j}+ \sum_{i=1}^n a_i{\partial \over…

Functional Analysis · Mathematics 2016-09-06 Alexander Koldobsky

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama