相关论文: Unambiguous Computation: Boolean Hierarchies and S…

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

We proved in a previous work that Cattani-Sassone's higher dimensional transition systems can be interpreted as a small-orthogonality class of a topological locally finitely presentable category of weak higher dimensional transition…

Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$ there is a tileset $\tau$ with a set of configurations $C$ such that $P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a computable set of…

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Let $f,g:X \to Y$ be continuous mappings. We say that $f$ is topologically equivalent to $g$ if there exist homeomorphisms $\Phi : X\to X$ and $\Psi: Y\to Y$ such that $\Psi\circ f\circ \Phi=g.$ Let $X,Y$ be complex smooth irreducible…

We prove two lower bounds for stopping times of sequential tests between general composite nulls and alternatives. The first lower bound is for the setting where the type-1 error level $\alpha$ approaches zero, and equals $\log(1/\alpha)$…

We present a similarity transformation theory based on a polynomial form of a particle-hole pair excitation operator. In the weakly correlated limit, this polynomial becomes an exponential, leading to coupled cluster doubles. In the…

We demonstrate advantages of non-standard grading for computing cohomology of restricted Hamiltonian and Poisson algebras. These algebras contain the inner grading element in the properly defined symmetric grading compatible with the…

We present a structure theorem for the multiple non-cyclotomic irreducible factors appearing in the family of all univariate polynomials with a given set of coefficients and varying exponents. Roughly speaking, this result shows that the…

This paper introduces a class of polynomial maps in Euclidean spaces, investigates the conditions under which there exist Smale horseshoes and uniformly hyperbolic invariant sets, studies the chaotic dynamical behavior and strange…

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

We introduce a generalization of Selman's P-selectivity that yields a more flexible notion of selectivity, called (polynomial-time) multi-selectivity, in which the selector is allowed to operate on multiple input strings. Since our…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template…

Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…

We consider non-Hermitian tight-binding one-dimensional Hamiltonians and show that imposing a certain symmetry causes all eigenvalues to pair up and the corresponding eigenstates to coalesce in pairs. This Pairwise Coalescence (PC) is an…

We consider the eigenvalue pair correlation problem for certain integrable quantum maps on the 2-sphere. The classical maps are time one maps of Hamiltonian flows of perfect Morse functions. The quantizations are unitary operators on spaces…