Related papers: Decreasing Minimization on M-convex Sets: Backgrou…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets…
Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the…
Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, particularly greedy…
Given an algebra $F[H]^G$ of polynomial invariants of an action of the group $G$ over the vector space $H$, a subset $S$ of $F[H]^G$ is called separating if $S$ separates all orbits that can be separated by $F[H]^G$. A minimal separating…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
In this paper the authors prove fundamental decomposition theorems pertaining to the internal structure of monoidal triangulated categories (M$\Delta$Cs). The tensor structure of an M$\Delta$C enables one to view these categories like…
We construct harmonic diffeomorphisms from the complex plane $C$ onto any Hadamard surface $M$ whose curvature is bounded above by a negative constant. For that, we prove a Jenkins-Serrin type theorem for minimal graphs in $M\times R$ over…
A jump system is defined as a set of integer points (vectors) with a certain exchange property, generalizing the concepts of matroids, delta-matroids, and base polyhedra of integral polymatroids (or submodular systems). A discrete convexity…
Problems from metric graph theory like Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact in parameterized complexity by being the first known problems in NP to admit double-exponential lower…
We present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to capture, in the context of solving the half-integral linkage…
A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…
A monitoring edge-geodetic set (or meg-set for short) of a graph is a set of vertices $M$ such that if any edge is removed, then the distance between some two vertices of $M$ increases. This notion was introduced by Foucaud et al. in 2023…
The decomposition of undirected graphs simplifies complex problems by breaking them into solvable subgraphs, following the philosophy of divide and conquer. This paper investigates the relationship between atom decomposition and the maximum…
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
Maximally monotone operators and firmly nonexpansive mappings play key roles in modern optimization and nonlinear analysis. Five years ago, it was shown that if finitely many firmly nonexpansive operators are all asymptotically regular…
Reductions---rules that reduce input size while maintaining the ability to compute an optimal solution---are critical for developing efficient maximum independent set algorithms in both theory and practice. While several simple reductions…
Conventional magnetic flux concentrators (MFCs) are typically designed with solid structures, which may not be optimal for applications requiring lightweight design or material efficiency. In this study, we investigate the feasibility of…
The scalar and vector Laplacians are basic operators in physics and engineering. In applications, they show up frequently perturbed by lower-order terms. The effect of such perturbations on mixed finite element methods in the scalar case is…