Related papers: Parametrized complexity of relations between multi…
We study the parameterized complexity of MinCSP for so-called equality languages, i.e., for finite languages over an infinite domain such as $\mathbb{N}$, where the relations are defined via first-order formulas whose only predicate is $=$.…
In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary between sofic shifts and effective ones. To this end, we use…
We propose a probabilistic semantic filtering framework in which parameters of a dynamical system are inferred and associated with a closed set of semantic classes in a map. We extend existing methods to a multi-parameter setting using a…
We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…
The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…
Parametric correlations are studied in several classes of covariant density functional theories (CDFTs) using a statistical analysis in a large parameter hyperspace. In the present manuscript, we investigate such correlations for two…
We study the symmetry properties of autonomous integrating factors from an algebraic point of view. The symmetries are delineated for the resulting integrals treated as equations and symmetries of the integrals treated as functions or…
Systems that synchronize in nature are intrinsically different from one another, with possibly large differences from system to system. While a vast part of the literature has investigated the emergence of network synchronization for the…
In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL)…
The complexity of condensed matter arises from emergent behaviors that cannot be understood by analyzing individual constituents in isolation. While traditional condensed-matter approaches-developed primarily for ideal crystalline…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
Multimodal learning leverages the integration of diverse data modalities to enhance performance in complex tasks. Yet, it frequently encounters incomplete or redundant modality data in real-world scenarios. This paper presents a…
This paper studies the computational complexity of a robust variant of a two-stage submodular minimization problem that we call Robust Submodular Minimizer. In this problem, we are given $k$ submodular functions~$f_1,\dots,f_k$ over a set…
Given a bipartite graph $G=(U\cup V,E)$, a left-perfect many-to-one matching is a subset $M \subseteq E$ such that each vertex in $U$ is incident with exactly one edge in $M$. If $U$ is partitioned into some groups, the matching is called…
A many variable $q$-calculus is introduced using the formalism of braided covector algebras. Its properties when certain of its deformation parameters are roots of unity are discussed in detail, and related to fractional supersymmetry. The…
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…
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…
An applied problem facing all areas of data science is harmonizing data sources. Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable…
We offer an overview of the specification property, its relatives and their consequences. We examine relations between specification-like properties and such notions as: mixing, entropy, the structure of the simplex of invariant measures,…
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…