Related papers: On the complexity of solving linear congruences an…
The Euler-Kronecker constants related to congruences of Fourier coefficients of modular forms that have been computed so far, involve logarithmic derivatives of Dirichlet $L$-series as most complicated functions (to the best of our…
In this paper, we investigate the Lie algebra structures of weight one subspaces of $C_2$-cofinite vertex operator superalgebras. We also show that for any positive integer $k$, vertex operator superalgebras $L_{sl(1|n+1)}(k,0)$ and…
We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse…
Open questions with respect to the computational complexity of linear CNF formulas in connection with regularity and uniformity are addressed. In particular it is proven that any l-regular monotone CNF formula is XSAT-unsatisfiable if its…
We investigate infinite dimensional modules for a linear algebraic group $\mathbb G$ over a field of positive characteristic $p$. For any subcoalgebra $C \subset \mathcal O(\mathbb G)$ of the coordinate algebra of $\mathbb G$, we consider…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…
We define L-functions for meromorphic modular forms that are regular at cusps, and use them to: (i) find new relationships between Hurwitz class numbers and traces of singular moduli, (ii) establish predictions from the physics of…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in the papers [15] and [16]. In this paper, we introduce and study the class of modal pseudocomplemented De Morgan algebras enriched by an…
We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…
Let $\FRAK{g}$ be a classical simple Lie superalgebra. To every nilpotent orbit $\cal O$ in $\FRAK{g}_0$ we associate a Clifford algebra over the field of rational functions on $\cal O$. We find the rank, $k(\cal O)$ of the bilinear form…
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…
We show, in an effective way, that there exists a sequence of congruence classes $a_k\pmod {m_k}$ such that the minimal solution $n=n_k$ of the congruence $\phi(n)\equiv a_k\pmod {m_k}$ exists and satisfies $\log n_k/\log m_k\to\infty $ as…
A system of linear constraints can be unsatisfiable and yet admit a solution in the form of quantum observables whose correlated outcomes satisfy the constraints. Recently, it has been claimed that such a satisfiability gap can be…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in the quest for a logic to capture all problems decidable in logarithmic space. It extends FO+C, first-order logic with counting, by an operator that formalises a limited…
If the $\ell$-adic cohomology of a projective smooth variety, defined over a local field $K$ with finite residue field $k$, is supported in codimension $\ge 1$, then every model over the ring of integers of $K$ has a $k$-rational point. For…