Related papers: Resolution with Symmetry Rule applied to Linear Eq…
Studied here is the effect of the presence of symmetry groups in a system of algebraic equations on the numerical resolution with fixed-point algorithms. It is proved that the symmetries imply two important properties of the system: the…
We prove general theorems for isoperimetric problems on lattices of the form ${\mathbb{Z}}^{k} \times {\mathbb{N}}^{d}$ which state that the perimeter of the optimal set is a monotonically increasing function of the volume under certain…
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…
This paper develops a new framework, \emph{simultaneous saturation}, designed to quantify the size of sets whose elements are simultaneously large. The framework establishes a correspondence between the magnitude of such sets and a system…
The computational complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
The RFMP is an iterative regularization method for a class of linear inverse problems. It has proved to be applicable to problems which occur, for example, in the geosciences. In the early publications [Fischer2011] and [FischerMichel2012],…
To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…
Meta-kernelization theorems are general results that provide polynomial kernels for large classes of parameterized problems. The known meta-kernelization theorems, in particular the results of Bodlaender et al. (FOCS'09) and of Fomin et al.…
Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
We study the set of common $\mathbb{F}_q$-rational solutions of "smooth" systems of multivariate symmetric polynomials with coefficients in a finite field $\mathbb{F}_q$. We show that, under certain conditions, the set of common solutions…
In this paper, we discuss the state feedback output regulation problem (SFRP) for infinite-dimensional linear control systems with infinite-dimensional exosystems. Under the polynomial stabilizability assumption, sufficient and necessary…
We prove an existence theorem for positive solutions to Lichnerowicz-type equations on complete manifolds with boundary and nonlinear Neumann conditions. This kind of nonlinear problems arise quite naturally in the study of solutions for…
In this article we first establish the maximum principle of the antisymmetric functions for parabolic fractional $p$-equations. Then we use it and the parabolic inequalities to provide a different proof of symmetry and monotonicity for…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
We take advantage of a rigidity result for the equation satisfied by an extremal function associated with a special case of the Caffarelli-Kohn-Nirenberg inequalities to get a symmetry result for a larger set of inequali-ties. The main…