Related papers: Inverse monoids associated with the complexity cla…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
The so-called inverse problem of dynamics is about constructing a potential for a given family of curves. We observe that there is a more general way of posing the problem by making use of ideas of another inverse problem, namely the…
Larrauri and \v{Z}ivn\'y [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid $N$ assuming that a solution exists over a monoid $M$, where both…
We study the monoid of so called projection functors $\p{S}$ attached to simple modules $S$ of a finite dimensional algebra, which appear naturally in the study of torsion pairs. We determine defining relations in special cases of path…
In this paper, we introduce new representation and characterization of the weighted core inverse of matrices. Several properties of these inverses and their interconnections with other generalized inverses are also explored. Through…
The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…
This is the first part of a series of three strongly related papers in which three equivalent structures are studied: - internal categories in categories of monoids; defined in terms of pullbacks relative to a chosen class of spans -…
We give a number of constructions where inverse limits seriously degrade properties of regular rings, such as unit-regularity, diagonalisation of matrices, and finite stable rank. This raises the possibility of using inverse limits to…
In this paper, we study the Moore-Penrose inverses of differences and products of projectors in a ring with involution. Also, some necessary and sufficient conditions for the existence of such inverses are given, and their expressions are…
Inverse and bilevel optimization problems play a central role in both theory and applications. These two classes are known to be closely related due to the pioneering work of Dempe and Lohse (2006), and thus have often been discussed…
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…
Interactions between units in phyical, biological, technological, and social systems usually give rise to intrincate networks with non-trivial structure, which critically affects the dynamics and properties of the system. The focus of most…
The classes of 1MP-inverses and MP1-inverses are recently introduced classes of generalized inverses of complex matrix. Actually, they coincide with the classes of $\{1,2,3\}$ and $\{1,2,4\}$ inverses, respectively. We consider these…
An immersion $f : {\mathcal D} \rightarrow \mathcal C$ between $\Delta$-complexes is a $\Delta$-map that induces injections from star sets of $\mathcal D$ to star sets of $\mathcal C$. We study immersions between finite-dimensional…
The CMI Millennium "P vs NP Problem" can be resolved e.g. if one shows at least one counterexample to the conjecture "P is equal to NP". A certain class of problems being such counterexamples is formulated. This implies the rejection of the…
Variable order differential equations with non-integrable singularities are considered on spatial networks. Properties of the spectrum are established, and the solution of the inverse spectral problem is obtained.
Many NP-complete problems take integers as part of their input instances. These input integers are generally binarized, that is, provided in the form of the "binary" numeral representation, and the lengths of such binary forms are used as a…
This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard when considering general precedence constraints, while they…
Using a new technique involving integration it is possible to find the exact roots of simple functions. In this case, simple functions are defined as smooth functions having an inverse, and that inverse having an antiderivative. This…
The dual symmetric inverse monoid $\mathscr{I}_n^*$ is the inverse monoid of all isomorphisms between quotients of an $n$-set. We give a monoid presentation of $\mathscr{I}_n^*$ and, along the way, establish criteria for a monoid to be…