Related papers: Remarks on Artin approximation with constraints

We show that many machine learning goals, such as improved fairness metrics, can be expressed as constraints on the model's predictions, which we call rate constraints. We study the problem of training non-convex models subject to these…

We consider the problem of approximation of a continuous function $f$ defined on a compact metric space $X$ by elements from a sum of two algebras. We prove a de la Vall\'{e}e Poussin type theorem, which estimates the approximation error…

In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial…

First we recall the notion of conxity and log-convexity for real-valued. Then we generalize the trick used by Artin in his famous paper on the Gamma function to find log-convex solutions to the functional equations f(x+1)=g(x)f(x). This…

We show that badly approximable matrices are exactly those that, for any inhomogeneous parameter, can not be inhomogeneous approximated at every monotone divergent rate, which generalizes Ram\'irez's result (2018). We also establish some…

We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…

This paper shows how to build a formal analytical solution for a differential equation of arbitrary order and with variable coefficients. It proofs that the most known approximated solutions for such a problem can be derived from the…

We study the Lusin approximation problem for real-valued measurable functions on Carnot groups. We prove that k-approximate differentiability almost everywhere is equivalent to admitting a Lusin approximation by $C^{k}_{\mathbb{G}}$ maps.…

Given a finite non-degenerate set-theoretic solution $(X,r)$ of the Yang-Baxter equation and a field $K$, the structure $K$-algebra of $(X,r)$ is $A=A(K,X,r)=K\langle X\mid xy=uv \mbox{ whenever }r(x,y)=(u,v)\rangle$. Note that…

We study the De Giorgi type conjecture, that is, one dimensional symmetry problem for entire solutions of an two components elliptic system in $\mathbb{R}^n$, for all $n\geq 2$. We prove that, if a solution $(u,v)$ has a linear growth at…

It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…

We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…

We study two principle minimizing problems, subject of different constraints. Our open sets are assumed bounded, except mentioning otherwise;precisely $\Omega=]0,1[^n \in {\mathbb{R}}^n , n=1 $ or $n=2$.

We interpret the Artin-Rees lemma and the Izumi theorem in term of Artin function and we obtain a stable version of the Artin-Rees lemma. We present different applications of these interpretations. First we show that the Artin function of…

We introduce an alternative approach for constrained mathematical programming problems. It rests on two main aspects: an efficient way to compute optimal solutions for unconstrained problems, and multipliers regarded as variables for a…

In this paper, we show that there exists a balanced linear threshold function (LTF) which is unique games hard to approximate, refuting a conjecture of Austrin, Benabbas, and Magen. We also show that the almost monarchy predicate on k…

Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In…

We consider a wide class of linear boundary-value problems for systems of $m$ ordinary differential equations of order $r$, known as general boundary-value problems. Their solutions $y:[a,b]\to \mathbb{C}^{m}$ belong to the Sobolev space…

We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…