Related papers: Complexity and speed of semi-algebraic multi-persi…
In this article we derive a priori error estimates for the $hp$-version of the mortar finite element method for parabolic initial-boundary value problems. Both semidiscrete and fully discrete methods are analysed in $L^2$- and $H^1$-norms.…
Let $(\mathfrak{M},\rho,\mu)$ be a metric measure space satisfying a doubling condition, $p_0\in (1,\infty)$, and $T(t):L^{p_0}(\mathfrak{M},\mu)\rightarrow L^{p_0}(\mathfrak{M},\mu)$, $t\geq 0$, a strongly continuous semi-group. We provide…
In a \emph{separability problem}, we are given two sets $K$ and $L$ from a class $\mathcal{C}$, and we want to decide whether there exists a set $S$ from a class $\mathcal{S}$ such that $K\subseteq S$ and $S\cap L=\emptyset$. In this case,…
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…
Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensional vector space…
Given a semigroup $S$, we introduce relative (with respect to a filter $\tau$ on $S$) versions of large, thick and prethick subsets of $S$, give the ultrafilter characterizations of these subsets and explain how large could be some cell in…
Bilevel reinforcement learning (BRL) has emerged as a powerful framework for aligning generative models, yet its theoretical foundations, especially sample complexity bounds, remain underexplored. In this work, we present the first sample…
In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…
Recently it has been shown that the complexity of SU($n$) operator is determined by the geodesic length in a bi-invariant Finsler geometry, which is constrained by some symmetries of quantum field theory. It is based on three axioms and one…
In this paper we produce a few continuations of our previous work on partitions into fractions. Specifically, we study strictly increasing integer sequences $\{n_j\}$ such that there are partitions for all integers less than the floor of…
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show…
This paper aims to investigate the numerical approximation of semilinear non-autonomous stochastic partial differential equations (SPDEs) driven by multiplicative or additive noise. Such equations are more realistic than autonomous SPDEs…
We establish strong Feller property and irreducibility for the transition semigroup associated to a class of nonlinear stochastic partial differential equations with multiplicative degenerate noise. As a by-product, we prove uniqueness of…
We show that there is a language in $\mathsf{S}_2\mathsf{E}/_1$ (symmetric exponential time with one bit of advice) with circuit complexity at least $2^n/n$. In particular, the above also implies the same near-maximum circuit lower bounds…
In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…
Given a polynomial ring $P$ over a field $K$, an element $g \in P$, and a $K$-subalgebra $S$ of $P$, we deal with the problem of saturating $S$ with respect to $g$, i.e. computing $Sat_g(S) = S[g, g^{-1}]\cap P$. In the general case we…
Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group){Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional…
We study the exponent of the exponential rate of convergence in terms of the number of degrees of freedom for various non-standard {$p$-version} finite element spaces employing reduced cardinality basis. More specifically, we show that…