Related papers: A refinement of Cauchy-Schwarz complexity
The study of the Dirac system and second-order elliptic equations with complex-valued coefficients on the plane leads to bicomplex Vekua equations. To the difference of complex pseudoanalytic (generalized analytic) functions the theory of…
In this paper we address the problem of studying those complex manifolds $M$ equipped with extremal metrics $g$ induced by finite or infinite dimensional complex space forms. We prove that when $g$ is assumed to be radial and the ambient…
We introduce a new 1-matrix model with arbitrary potential and the matrix-valued background field. Its partition function is a $\tau$-function of KP-hierarchy, subjected to a kind of ${\cal L}_{-1}$-constraint. Moreover, partition function…
In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…
The notion of slow entropy, both upper and lower slow entropy, was defined by Katok and Thouvenot as a more refined measure of complexity for dynamical systems, than the classical Kolmogorov-Sinai entropy. For any subexponential rate…
We study two-dimensional quantum gravity on arbitrary genus Riemann surfaces in the Kaehler formalism where the basic quantum field is the (Laplacian of the) Kaehler potential. We do a careful first-principles computation of the fixed-area…
We investigate the $k$-error linear complexity of pseudorandom binary sequences of period $p^{\mathfrak{r}}$ derived from the Euler quotients modulo $p^{\mathfrak{r}-1}$, a power of an odd prime $p$ for $\mathfrak{r}\geq 2$. When…
To an arbitrary variety over a field of characteristic zero, we associate a complex of Chow motives, which is, up to homotopy, unique and bounded. We deduce that any variety has a natural Euler characteristic in the Grothendieck group of…
We study two-dimensional cyclic quotient singularities defined by $k$-Wahl chains, a class of Hirzebruch--Jung continued fractions obtained inductively starting from $[k+2]$. This class includes the classical Wahl singularities in the case…
We study the concept of (generalized) $p$-th variation of a real-valued continuous function along a general class of refining sequence of partitions. We show that the finiteness of the $p$-th variation of a given function is closely related…
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…
We apply the recently developed notion of complexity for field theory to a quantum quench through a critical point in 1+1 dimensions. We begin with a toy model consisting of a quantum harmonic oscillator, and show that complexity exhibits…
For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…
We formulate the constrained KP hierarchy (denoted by \cKP$_{K+1,M}$) as an affine ${\widehat {sl}} (M+K+1)$ matrix integrable hierarchy generalizing the Drinfeld-Sokolov hierarchy. Using an algebraic approach, including the graded…
We initiate a study of the complexity of quantum field theories (QFTs) by proposing a measure of information contained in a QFT and its observables. We show that from minimal assertions, one is naturally led to measure complexity by two…
We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…
We propose probabilistic representations for inverse Stein operators (i.e. solutions to Stein equations) under general conditions; in particular we deduce new simple expressions for the Stein kernel. These representations allow to deduce…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…