相关论文: Robustness of solutions of almost every system of …

In a "structured system" of equations, each equation depends on a specified subset of the variables. In this article, we explore properties common to "almost every" system with a fixed structure and how the properties can be read from the…

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

The paper describes an algorithm that, given an initial design $\mathcal{F}_n$ of size $n$ and a linear model with $p$ parameters, provides a sequence $\mathcal{F}_n \supset \ldots \supset \mathcal{F}_{n-k} \supset \ldots \supset…

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

We introduce a fairly general concept of functional equation for $k$-tuples of functions $f_1,\dots,f_k\colon X \to Y$ between arbitrary sets. The homomorphy equations for mappings between groups and other algebraic systems, as well as…

A function $f\in \BUC(\R^d)$ is said to be weakly* almost periodic, denoted $f\in\APs(\R^d)$, if there is $g\in\AP(\R^d)$, such that, $\oM(|f-g|)=0$, where $\BUC(\R^d)$ and $\AP(\R^d)$ are, respectively, the space of bounded uniformly…

Robustness is a correctness notion for concurrent programs running under relaxed consistency models. The task is to check that the relaxed behavior coincides (up to traces) with sequential consistency (SC). Although computationally simple…

We study the complexity of approximately solving the weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, there is a classification known for the case in which the domain…

We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness…

ML models are typically trained using large datasets of high quality. However, training datasets often contain inconsistent or incomplete data. To tackle this issue, one solution is to develop algorithms that can check whether a prediction…

Let $k$ be an algebraically closed field of characteristic $p>0$, let $R$ be a commutative ring and let $\mathcal{F}$ be an algebraically closed field of characteristic $0$. We introduce the category $\overline{\mathcal{F}_{Rpp_k}}$ of…

Let $F=(f_1,...,f_q)$ be a polynomial dominating map from $\mathbb{C}^n$ to $\mathbb{C}^q$. We study the quotient ${\cal{T}}^1(F)$ of polynomial 1-forms that are exact along the fibres of $F$, by 1-forms of type $dR+\sum a_idf_i$, where…

Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

When a category $\mathcal{C}$ satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors $F:\mathbf{P} \rightarrow \mathcal{C}$ from a category theory perspective. This generalizes the standard…

A kinetic system has an absolute concentration robustness (ACR) for a molecular species if its concentration remains the same in every positive steady state of the system. Just recently, a condition that sufficiently guarantees the…

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

We show that in finite-dimensional nonlinear approximations, the best $r$-term approximant of a function $f$ almost always exists over $\mathbb{C}$ but that the same is not true over $\mathbb{R}$, i.e., the infimum $\inf_{f_1,\dots,f_r \in…

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…