Related papers: Openness of Regular Regimes of Complex Random Matr…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
We propose a Bethe-Ansatz-type solution of the open spin-1/2 integrable XXZ quantum spin chain with general integrable boundary terms and bulk anisotropy values i \pi/(p+1), where p is a positive integer. All six boundary parameters are…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…
We study properties of the Weyl pseudometric associated with an action of a countable amenable group on a compact metric space. We prove that the topological entropy and the number of minimal subsets of the closure of an orbit are both…
In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $L/k$, where $L$ is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show…
Optimization of DR-submodular functions has experienced a notable surge in significance in recent times, marking a pivotal development within the domain of non-convex optimization. Motivated by real-world scenarios, some recent works have…
Fix a rational prime $r \geq 5$. In this article, we study the integer solutions of the generalized Fermat equation of signature $(2p,2q,r)$, namely $x^{2p}+y^{2q}=z^r$, where the primes $p,q \geq 5$ are varying. For each rational prime $r…
We prove subelliptic estimates for ethe complex Green operator $ K_q $ at a specific level $ q $ of the $ \bar\partial_b $-complex, defined on a not necessarily pseudoconvex CR manifold satisfying the commutator finite type condition.…
We study algorithms for the Submodular Multiway Partition problem (SubMP). An instance of SubMP consists of a finite ground set $V$, a subset of $k$ elements $S = \{s_1,s_2,...,s_k\}$ called terminals, and a non-negative submodular set…
Let K be a totally real Galois number field and let A be a set of elliptic curves over K. We give sufficient conditions for the existence of a finite computable set of rational primes P such that for p not in P and E in A, the…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
We study spectral gaps of the one-dimensional totally asymmetric simple exclusion process (TASEP) with open boundaries in the maximal current phase. Earlier results for the model with periodic boundaries suggest that the gaps contributing…
Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…
We consider shape optimization problems involving functionals depending on perimeter, torsional rigidity and Lebesgue measure. The scaling free cost functionals are of the form $P(\Omega)T^q(\Omega)|\Omega|^{-2q-1/2}$ and the class of…
We study the asymmetric simple exclusion process (ASEP) on a segment $\{1,\ldots,b_N\}$ and are interested in its total variation distance to equilibrium when started from an initial configuration $\xi^{N}$. We provide a general result…
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique…
We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…