Related papers: Supercritical Space-Width Trade-offs for Resolutio…
A range of experimental results point to the existence of a massive neutrino. The recent high precision measurements of the cosmic microwave background and the large scale surveys of galaxies can be used to place an upper bound on this…
We use the approximation method of Razborov to analyze the locality barrier which arose from the investigation of the hardness magnification approach to complexity lower bounds. Adapting a limitation of the approximation method obtained by…
This paper talks about difference between P and NP by using topological space that mean resolution principle. I pay attention to restrictions of antecedent and consequent in resolution, and show what kind of influence the restrictions have…
In this work, constructions of ordered covering arrays are discussed and applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman spaces (RT spaces), improving or extending some previous results.
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
Some mathematical questions relating to Coset Conformal Field Theories (CFT) are considered in the framework of Algebraic Quantum Field Theory as developed previously by us. We consider the issue of fixed point resolution in the diagonal…
We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…
Transforming Penrose's intuitive picture of a strong cosmic censorship principle, that generically forbids the appearance of locally naked space-time singularities, into a formal mathematical proof, remains at present, one of the most…
Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only…
Modern CNN are typically based on floating point linear algebra based implementations. Recently, reduced precision NN have been gaining popularity as they require significantly less memory and computational resources compared to floating…
We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsilon}}$ we exhibit an explicit family…
Second-order optimization methods, such as cubic regularized Newton methods, are known for their rapid convergence rates; nevertheless, they become impractical in high-dimensional problems due to their substantial memory requirements and…
We present a general framework for good CNF-representations of boolean constraints, to be used for translating decision problems into SAT problems (i.e., deciding satisfiability for conjunctive normal forms). We apply it to the…
High-order reconstruction schemes for the solution of hyperbolic conservation laws in orthogonal curvilinear coordinates are revised in the finite volume approach. The formulation employs a piecewise polynomial approximation to the…
We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \over N^{1+\epsilon}}$. We do this by obtaining quite…
Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the…
We prove fractional order Hardy inequalities on open sets under a combined fatness and visibility condition on the boundary. We demonstrate by counterexamples that fatness conditions alone are not sufficient for such Hardy inequalities to…
We solve the following problem of Z. F\"uredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in $n$ for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such…
Stability of AdS space allows scalar fields to have negative mass squared as long as the Breitenlohner-Freedman bound is satisfied. In a compactification of AdS instead, to avoid instabilities, a tachyonic bulk mass must be supplemented by…
The Strong Cosmic Censorship conjecture states that for generic initial data to Einstein's field equations, the maximal globally hyperbolic development is inextendible. We prove this conjecture in the class of orthogonal Bianchi class B…