Related papers: Counting linear congruence systems with a fixed nu…

Our aim is to find a general approach to the theory of classical solutions of the Garnier system in $n$-variables, ${\cal G}_n$, based on the Riemann-Hilbert problem and on the geometry of the space of isomonodromy deformations. Our…

Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the…

We consider the set Sigma(R,C) of all mxn matrices having 0-1 entries and prescribed row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We prove an asymptotic estimate for the cardinality |Sigma(R, C)| via the solution to a…

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

We establish the universality of the singular numbers in random matrix products over $\mathrm{GL}_n(\mathbb{Q}_p)$ as the number of products approaches infinity, with a fixed $n\ge 1$. We demonstrate that, under a broad class of…

We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…

Let $X=(x_{ij})$ and $Y=(y_{ij})$ be generic $n$ by $n$ matrices and $Z=XY-YX$. Let $S=k[x_{11},...,x_{nn},y_{11},...,y_{nn}]$, where $k$ is a field, let $I$ be the ideal generated by the entries of $Z$ and let $R=S/I$. We give a conjecture…

We consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c $ in nonnegative integers $x, y$ and integers $u, v \in \{0,1\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$. When…

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

We discuss practical methods for computing the space of solutions to an arbitrary homogeneous linear system of partial differential equations with constant coefficients. These rest on the Fundamental Principle of Ehrenpreis-Palamodov from…

The pole placement problem belongs to the classical problems of linear systems theory. It is often assumed that the ground field is the real numbers R or the complex numbers C. The major result over the complex numbers derived in 1981 by…

This article proposes a new class of general linear method with $p=q$ and $r=s=p+1$. The construction of the present method is carried out using order conditions and error minimization subject to $A$- stability constraints. The proposed…

A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

Let $S$ be a finite set of positive integers with largest element $m$. Let us randomly select a composition $a$ of the integer $n$ with parts in $S$, and let $m(a)$ be the multiplicity of $m$ as a part of $a$. Let $0\leq r<q$ be integers,…

Given a matrix $A\in \mathrm{GL}_d(\mathbb{Z})$. We study the pseudorandomness of vectors $\mathbf{u}_n$ generated by a linear recurrent relation of the form $$ \mathbf{u}_{n+1} \equiv A \mathbf{u}_n \pmod {p^t}, \qquad n = 0, 1, \ldots, $$…

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…