Related papers: Eliminating Human Insight: An Algorithmic Proof of…
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in…
We prove that two general Enriques surfaces defined over an algebraically closed field of characteristic different from $2$ are isomorphic if their Kuznetsov components are equivalent. We apply the same techniques to give a new simple proof…
A *-algebraic indefinite structure of quantum stochastic (QS) calculus is introduced and a continuity property of generalized nonadapted QS integrals is proved under the natural integrability conditions in an infinitely dimensional nuclear…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We present an algorithm for reliably and systematically proving the existence of spectral gaps in Hamiltonians with quasicrystalline order, based on numerical calculations on finite domains. We apply this algorithm to prove that the…
Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representation and reasoning (KR)…
In previous paper, the author applied the permanent-determinant method of Kasteleyn and its non-bipartite generalization, the Hafnian-Pfaffian method, to obtain a determinant or a Pfaffian that enumerates each of the ten symmetry classes of…
Let S_d be the symmetric group on d letters and let k be a field of characteristic p>2. Tensoring an irreducible S_d module with the sign representation defines an involution on the p-regular partitions of d. It is suprisingly difficult to…
We prove that there exists a topologically mixing homeomorphism which is completely scrambled. We also prove that for any integer $n\geq 1$ there is a continuum of topological dimension $n$ supporting a transitive completely scrambled…
The paper is devoted to an algebraic interpretation of Kuznetsov's theorem which establishes the assertoric equipollence of intuitionistic and proof-intuitionistic propositional calculi. Given a Heyting algebra, we define an enrichable…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
These are notes from my lectures on quantum K-theory of Nakajima quiver varieties and K-theoretic Donaldson-Thomas theory of threefolds given at Columbia and Park City Mathematics Institute. They contain an introduction to the subject and a…
In this paper we introduce the essential Lagrange multiplier and establish the solid mathematical foundation of constrained optimization in Hilbert spaces with sharp results on the mathematical foundation of quadratic-programming based…
Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is of great challenge. A useful approach, the projection method…
Symmetry is a guiding principle in physics that allows to generalize conclusions between many physical systems. In the ongoing search for new topological phases of matter, symmetry plays a crucial role because it protects topological…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
We prove versions of Khintchine's Theorem (1924) for approximations by rational numbers whose numerators lie in randomly chosen sets of integers, and we explore the extent to which the monotonicity assumption can be removed. Roughly…
We prove a conjecture of Mills, Robbins and Rumsey [Alternating sign matrices and descending plane partitions, J. Combin. Theory Ser. A 34 (1983), 340-359] that, for any n, k, m and p, the number of nxn alternating sign matrices (ASMs) for…