Related papers: Complexity and speed of semi-algebraic multi-persi…

We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a structure $\mathfrak A$ can be transferred to a classification of…

Recently, significant progress has been made on semantic segmentation. However, the success of supervised semantic segmentation typically relies on a large amount of labelled data, which is time-consuming and costly to obtain. Inspired by…

We propose a semiclassical approach to calculate multiparticle cross sections in scalar theories, which have been strongly argued to have the exponential form $\exp(\lambda^{-1}F(\lambda n,\epsilon))$ in the regime $\lambda\to0$, $\lambda…

The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…

We construct "barcodes" for the chain complexes over Novikov rings that arise in Novikov's Morse theory for closed one-forms and in Floer theory on not-necessarily-monotone symplectic manifolds. In the case of classical Morse theory these…

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…

Let $\mathbb{K}$ be an algebraically closed field, and $A \subset \mathbb{K}[x_{1}, \ldots, x_n]$ be a subalgebra of finite codimension. It is known that there exists a (not necessarily unique) finite filtration of $\mathbb{K}$-algebras \[…

We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…

In this paper, we present a novel cross-consistency based semi-supervised approach for semantic segmentation. Consistency training has proven to be a powerful semi-supervised learning framework for leveraging unlabeled data under the…

We develop the theory of semisimple weak Hopf algebras and obtain analogues of a number of classical results for ordinary semisimple Hopf algebras. We prove a criterion for semisimplicity and analyze the square of the antipode S^2 of a…

Let $(X,\mathcal{B},\mu,T)$ be a measure preserving system. We say that a function $f\in L^2(X,\mu)$ is $\mu$-mean equicontinuous if for any $\epsilon>0$ there is $k\in \mathbb{N}$ and measurable sets ${A_1,A_2,\cdots,A_k}$ with…

Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…

For a field $R$ of characteristic $p\ge 0$ and a matrix $c$ in the full $n\times n$ matrix algebra $M_n(R)$ over $R$, let $S_n(c,R)$ be the centralizer algebra of $c$ in $M_n(R)$. We show that $S_n(c,R)$ is a Frobenius-finite,…

This work proposes a framework, embedded within the Performance Estimation framework (PEP), for obtaining worst-case performance guarantees on stochastic first-order methods. Given a first-order method, a function class, and a noise model…

There are two well known types of algorithms for solving CSPs: local propagation and generating a basis of the solution space. For several years the focus of the CSP research has been on `hybrid' algorithms that somehow combine the two…

C. Akemann and G. Pedersen defined three concepts of semicontinuity for self-adjoint elements of A**, the enveloping von Neumann algebra of a C*-algebra A. We give the basic properties of the analogous concepts for elements of pA**p, where…

A fundamental challenge in multiparameter persistent homology is the absence of a complete and discrete invariant. To address this issue, we propose an enhanced framework that realizes a holistic understanding of a fully commutative…

When implementing model predictive control (MPC) for hybrid systems with a linear or a quadratic performance measure, a mixed-integer linear program (MILP) or a mixed-integer quadratic program (MIQP) needs to be solved, respectively, at…

The Strong Exponential Time Hypothesis (SETH) is a standard assumption in (fine-grained) parameterized complexity and many tight lower bounds are based on it. We consider a number of reasonable weakenings of the SETH, with sources from (i)…

The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the last 20 years. A new version of the CSP, the promise CSP (PCSP) has recently been proposed, motivated by open questions about…