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

We prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on the number, the degree and the number of variables of the polynomials describing a semi-algebraic set $S$ and a point $x$ in $\bar S$, we find a…

The study of Locally Checkable Labelings (LCLs) has led to a remarkably precise characterization of the distributed time complexities that can occur on bounded-degree trees. A central feature of this complexity landscape is the existence of…

Let $P_3(\mathbf{C}^{\infty})$ be the space of complex cubic polynomials in infinitely many variables. We show that this space is $\mathbf{GL}_{\infty}$-noetherian, meaning that any $\mathbf{GL}_{\infty}$-stable Zariski closed subset is cut…

It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…

Motivated by the work of Douady, Ghys, Herman and Shishikura on Siegel quadratic polynomials, we study the one-dimensional slice of the cubic polynomials which have a fixed Siegel disk of rotation number theta, with theta being a given…

Compound matrices have found applications in many fields of science including systems and control theory. In particular, a sufficient condition for $k$-contraction is that a logarithmic norm (also called matrix measure) of the $k$-additive…

In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \to {0,1}$ except \equ where $k\geq 3$, we show that every (randomized)…

We present a post-processing certification workflow for nonlinear elliptic boundary value problems that upgrades a standard finite element computation to a rigorous existence and output certificate. For a given approximate discrete state,…

Let $g: \{-1,1\}^k \to \{-1,1\}$ be any Boolean function and $q_1,\dots,q_k$ be any degree-2 polynomials over $\{-1,1\}^n.$ We give a \emph{deterministic} algorithm which, given as input explicit descriptions of $g,q_1,\dots,q_k$ and an…

We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…

This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

The fundamental relationship between the partial quotients $b_{n+1}$ of an algebraic irrational $\alpha = \sqrt[m]{k}$ and its corresponding algebraic form $d_n = |p_n^m - k q_n^m|$ was elegantly proposed by Bombieri and van der Poorten. In…

In this note, we aim to prove the finite semi-algebraic chamber decomposition theorem for K-semi(poly)stability under the assumption of the log boundedness of K-semistable degenerations. This boundedness assumption is naturally arising from…

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…

We show that every monic polynomial of degree three with complex coefficients and no repeated roots is either a (vertical and horizontal) translation of $y=x^3$ or can be composed with a linear function to obtain a Ramanujan cubic. As a…

We perform a fundamental investigation of the complexity of conjunctive query evaluation from the perspective of parameterized complexity. We classify sets of boolean conjunctive queries according to the complexity of this problem. Previous…

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…