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

We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous…

Given a differential or $q$-difference equation $P$ of order $n$, we prove that the set of exponents of a generalized power series solution has its rational rank bounded by the rational rank of the support of $P$ plus $n$. We also prove…

In this paper, we introduce a new family of argument-ranking semantics which can be seen as a refinement of the classification of arguments into skeptically accepted, credulously accepted and rejected. To this end we use so-called social…

Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number theorem.

Under a hypothesis which is slightly stronger than the Riemann Hypothesis for elliptic curve $L$-functions, we show that both the average analytic rank and the average algebraic rank of elliptic curves in families of quadratic twists are…

A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…

Let $E/k$ be a non-isotrivial elliptic curve over a global function field $k$ of characteristic $p>3$, and $G\subset \mathrm{Gal}(k^{\mathrm{sep}}/k)$ be a topologically finitely generated subgroup. We prove that if $E/k$ has analytic rank…

We continue to investigate spt-type functions that arise from Bailey pairs. In this third paper on the subject, we proceed to introduce additional spt-type functions. We prove simple Ramanujan type congruences for these functions which can…

While examples of Ramanujan-type congruences are amply available via their relation to Hecke operators, it remains unclear which of them should be considered of combinatorial origin and which of them are mere artifacts of the connection…

In this note, we give a rank function axiomatization for delta-matroids and study the corresponding rank generating function. We relate an evaluation of the rank generating function to the number of independent sets of the delta-matroid,…

Previously, we proved an identity for theta functions of degree eight, and several applications of it were also discussed. This identity is a natural extension of the addition formula for the Weierstrass sigma-function. In this paper we…

Using specializations of unfold and fold on a generic tree data type we derive unranking and ranking functions providing natural number encodings for various Hereditarily Finite datatypes. In this context, we interpret unranking operations…

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…

The classical concept of $Q$-functions associated to symmetric and selfadjoint operators due to M.G. Krein and H. Langer is extended in such a way that the Dirichlet-to-Neumann map in the theory of elliptic differential equations can be…

For a global field K and an elliptic curve E_eta over K(T), Silverman's specialization theorem implies that rank(E_eta(K(T))) <= rank(E_t(K)) for all but finitely many t in P^1(K). If this inequality is strict for all but finitely many t,…

We introduce what we call `generalized higher rank $k$-graphs' as a class of categories equipped with a notion of size. They extend not only the higher rank $k$-graphs, but also the Levi categories introduced by the first author as a…

In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric codes and Ferrers diagram rank metric codes. These upper bounds yield the rank distance Singleton bound and an…

In 1944 Dyson defined the rank of a partition as the largest part minus the number of parts, and conjectured that the residue of the rank mod 5 divides the partitions of 5n+4 into five equal classes. This gave a combinatorial explanation of…

We explain how recent work on 3-descent and 4-descent for elliptic curves over Q can be combined to search for generators of the Mordell-Weil group of large height. As an application we show that every elliptic curve of prime conductor in…

In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word such that $x \in C$ and the $Rank(e)=r$. The first attack…