相关论文: Typical forcings, NP search problems and an extens…

We prove metric rigidity for complete manifolds supporting solutions of certain second order differential systems, thus extending classical works on a characterization of space-forms. In the route, we also discover new characterizations of…

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…

This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…

We give a parametrization with perfect subsets of $2^{\infty}$ of the abstract Ramsey theorem (see \cite{todo}) Our main tool is an extension of the parametrized version of the combinatorial forcing developed in \cite{nash} and \cite{todo},…

Hardness magnification reduces major complexity separations (such as $\mathsf{\mathsf{EXP}} \nsubseteq \mathsf{NC}^1$) to proving lower bounds for some natural problem $Q$ against weak circuit models. Several recent works [OS18, MMW19,…

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

We provide a uniform estimate for the $L^1$-norm (over any interval of bounded length) of the logarithmic derivatives of global normalizing factors associated to intertwining operators for the following reductive groups over number fields:…

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

We study the factorization and monotonicity method for inverse acoustic scattering problems. Firstly, we give a new general functional analysis theorem for the monotonicity method. Comparing with the factorization method, the general…

We introduce a generalized notion of finiteness that provides a structural principle for the set of effective theories that can be consistently coupled to quantum gravity. More concretely, we propose a Tameness Conjecture that states that…

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

We develop a forcing framework based on the idea of amalgamating language fragments into a theory with a canonical term model. We then demonstrate the usefulness of this framework by applying it to variants of the extended Namba problem, as…

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

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…

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

We investigate weak and strong structures for generalized topological spaces, among others products, sums, subspaces, quotients, and the complete lattice of generalized topologies on a given set. Also we introduce $T_{3.5}$ generalized…

We introduce a new variant of tight closure associated to any fixed ideal $\a$, which we call $\a$-tight closure, and study various properties thereof. In our theory, the annihilator ideal $\tau(\a)$ of all $\a$-tight closure relations,…

We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…