Related papers: A parameterized halting problem, $\Delta_0$ truth …
In this paper, we study an overdetermined problem with Kirchhoff type nonlocal terms related to the celebrated work by Serrin. We obtain the precise number of solutions according to the value of the bifurcation parameter and study…
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…
We show that some natural problems that are XNLP-hard (which implies W[t]-hardness for all t) when parameterized by pathwidth or treewidth, become FPT when parameterized by stable gonality, a novel graph parameter based on optimal maps from…
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT…
We consider the precision $\Delta \varphi$ with which the parameter $\varphi$, appearing in the unitary map $U_\varphi = e^{ i \varphi \Lambda}$ acting on some type of probe system, can be estimated when there is a finite amount of prior…
In Path Set Packing, the input is an undirected graph $G$, a collection $\calp$ of simple paths in $G$, and a positive integer $k$. The problem is to decide whether there exist $k$ edge-disjoint paths in $\calp$. We study the parameterized…
The Directed Rural Postman Problem (DRPP) can be formulated as follows: given a strongly connected directed multigraph $D=(V,A)$ with nonnegative integral weights on the arcs, a subset $R$ of $A$ and a nonnegative integer $\ell$, decide…
This paper proposes a novel approach to determining the internal parameters of the hashing-based approximate model counting algorithm $\mathsf{ApproxMC}$. In this problem, the chosen parameter values must ensure that $\mathsf{ApproxMC}$ is…
Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised…
Among bivariate tail dependence measures, the tail dependence coefficient has emerged as the popular choice. Akin to the correlation matrix, a multivariate dependence measure is constructed using these bivariate measures, and this is…
Heisenberg's uncertainty principle is often cited as an example of a "purely quantum" relation with no analogue in the classical limit where $\hbar \to 0$. However, this formulation of the classical limit is problematic for many reasons,…
Given a constraint satisfaction problem (CSP) on $n$ variables, $x_1, x_2, \dots, x_n \in \{\pm 1\}$, and $m$ constraints, a global cardinality constraint has the form of $\sum_{i = 1}^{n} x_i = (1-2p)n$, where $p \in (\Omega(1), 1 -…
We consider an elliptic problem with nonlinear boundary condition involving nonlinearity with superlinear and subcritical growth at infinity and a bifurcation parameter as a factor. We use re-scaling method, degree theory and continuation…
Two types of parameter dependent generalizations of classical matrix ensembles are defined by their probability density functions (PDFs). As the parameter is varied, one interpolates between the eigenvalue PDF for the superposition of two…
Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of…
A resolving set $S$ of a graph $G$ is a subset of its vertices such that no two vertices of $G$ have the same distance vector to $S$. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a…
The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…
In this paper we study the singular set in the parabolic obstacle problem for general obstacles $\varphi \in C^{2,1}$. We prove that the singular set has parabolic Hausdorff dimension at most $n-1$. Prior to our result, this was only known…
We present rigidity results for overdetermined problems associated to the rotationally invariant Poisson equation $-\Delta_{g_\mathcal{M}} u = f(r)$ in a model manifold $\mathcal{M} = [0,S) \times_h \mathbb S^{N-1}$ with warping function…