Related papers: A complex analogue of Toda's Theorem

The Toda lattice hierarchy is discussed in connection with the topological description of the $c=1$ string theory compactified at the self-dual radius. It is shown that when special constraints are imposed on the Toda hierarchy, it…

Toda field theories are important integrable systems. They can be regarded as constrained WZNW models, and this viewpoint helps to give their explicit general solutions, especially when a Drinfeld-Sokolov gauge is used. The main objective…

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers. The…

In this paper, modified Toda (mToda) equation is generalized to form an integrable hierarchy in the framework of Sato theory, which is therefore called mToda hierarchy. Inspired by the fact that Toda hierarchy is 2-component generalization…

We study the symmetric polynomial $\prod_{\alpha\in A_{n,d}}\bigl(1+\alpha_1 x_1+\cdots+\alpha_n x_n\bigr)$ where $A_{n,d}:=\{\alpha\in\mathbb{Z}_{\ge 0}^n:|\alpha|=d\}$, which is the total Chern class of $\mathrm{Sym}^d(\mathbb{C}^n)$,…

We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…

We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to…

The class TotP consists of functions that count the number of all paths of a nondeterministic polynomial-time Turing machine. In this paper, we give a predicate based definition of TotP, analogous to a standard definition of #P. From a new…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…

We consider "Taylor domination" property for an analytic function $f(z)=\sum_{k=0}^{\infty}a_{k}z^{k},$ in the complex disk $D_R$, which is an inequality of the form \[ |a_{k}|R^{k}\leq C\ \max_{i=0,\dots,N}\ |a_{i}|R^{i}, \ k \geq N+1. \]…

Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…

In this paper we prove that the full symmetric Toda system is integrable in the sense of the Lie-Bianchi criterion, i.e. that there exists a solvable Lie algebra of vector fields of dimension $N=\dim M$ on the phase space $M$ of this system…

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…

We show that the solution space of the noncommutative KP hierarchy is the same as that of the commutative KP hierarchy owing to the Birkhoff decomposition of groups over the noncommutative algebra. The noncommutative Toda hierarchy is…

Ibeling et al. (2023). axiomatize increasingly expressive languages of causation and probability, and Mosse et al. (2024) show that reasoning (specifically the satisfiability problem) in each causal language is as difficult, from a…

We construct an integrable hierarchy in terms of vertex operators and Hirota Quadratic Equations (HQE shortly) and we show that the equivariant total descendant potential of $\C P^1$ satisfies the HQE. Our prove is based on the quantization…