相关论文: Considering The Satisfiability of Cubic Diophantin…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

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 establish Monod's isomorphism conjecture in degree-three bounded cohomology for every complex simple Lie group of classical type. Our main ingredient is a bounded-cohomological stability theorem with an optimal range in degree three that…

A Diophantine $m$-tuple with elements in the field $K$ is a set of $m$ non-zero (distinct) elements of $K$ with the property that the product of any two distinct elements is one less than a square in $K$. Let $X: (x^2-1)(y^2-1)(z^2-1)=k^2,$…

Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We give an update on our derivation of a quantization condition relating the finite-volume spectrum of three particles in a cubic box to infinite-volume scattering quantities. We have discovered and fixed technical problems in the…

Let $X$ be a cubic surface over a global field $k$. We prove that a Brauer-Manin obstruction to the existence of $k$-points on $X$ will persist over every extension $L/k$ with degree relatively prime to $3$. In other words, a cubic surface…

We introduce the $k$-variable-occurrence fragment, which is the set of terms having at most $k$ occurrences of variables. We give a sufficient condition for the decidability of the equational theory of the $k$-variable-occurrence fragment…

We provide a necessary and sufficient condition for existence of Gaussian cubature formulas. It consists of checking whether some overdetermined linear system has a solution and so complements Mysovskikh's theorem which requires computing…

A new nonconforming rectangle element with cubic convergence for the energy norm is introduced. The degrees of freedom (DOFs) are defined by the twelve values at the three Gauss points on each of the four edges. Due to the existence of one…

For a single cusped hyperbolic 3-manifold, Hodgson proved that there are only finitely many Dehn fillings of it whose trace fields have bounded degree. In this paper, we conjecture the same for manifolds with more cusps, and give the first…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

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…

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

We prove that any finite-degree polynomial functor is topologically Noetherian. This theorem is motivated by the recent resolution of Stillman's conjecture and a recent Noetherianity proof for the space of cubics. Via work by…

Over extended systems of finite type arithmetic, we utilize a formal representation of the outer measure to define a translation which allows for the systematic formalization of probabilistic statements. As a main result, this translation…