Related papers: Borel-piecewise continuous reducibility for unifor…
We consider the global minimization of a particular type of minimum structured optimization problems wherein the variables must belong to some basic set, the feasible domain is described by the intersection of a large number of functional…
Let G be a piecewise constant $n\times n$ matrix function which is defined on a smooth closed curve $\Gamma$ in the complex sphere and which has m jumps. We consider the problem of determining the partial indices of the factorization of the…
This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…
In this article we introduce a class of discontinuous almost automorphic functions which appears naturally in the study of almost automorphic solutions of differential equations with piecewise constant argument. Their fundamental properties…
This article contains a new discussion for the generalized fractional Cauchy-type problem involving Hilfer-Katugampola-type fractional derivative. We study an existence and continuation of its solution. Firstly, we establish a new theorems…
In this paper we consider a reduction of a non-homogeneous linear system of first order operator equations to a totally reduced system. Obtained results are applied to Cauchy problem for linear differential systems with constant…
In this paper, we explore the graph partitioning problem, a pivotal combina-torial optimization challenge with extensive applications in various fields such as science, technology, and business. Recognized as an NP-hard prob-lem, graph…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models…
We prove various results in infinite-dimensional differential calculus which relate differentiability properties of functions and associated operator-valued functions (e.g., differentials). The results are applied in two areas: 1. in the…
The sufficient conditions for existence and uniqueness of continuous solutions of the Volterra operator equations of the first kind with piecewise continuous kernel are derived. The asymptotic approximation of the parametric family of…
We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…
Combinatorial algorithms are widely used for decision-making and knowledge discovery, and it is important to ensure that their output remains stable even when subjected to small perturbations in the input. Failure to do so can lead to…
In this paper, we deal with a Cauchy problem for a nonlinear fractional differential equation with the Caputo derivative of order $\alpha \in (0, 1)$. As initial data, we consider a pair consisting of an initial point, which does not…
Geometrically continuous splines are piecewise polynomial functions defined on a collection of patches which are stitched together through transition maps. They are called $G^{r}$-splines if, after composition with the transition maps, they…
In this paper, we delve into the fascinating realm of fractal calculus applied to fractal sets and fractal curves. Our study includes an exploration of the method analogues of the separable method and the integrating factor technique for…
We study the position of the computable setting in the "common theory of locality" developed in arXiv:2106.02066 and arXiv:2204.09329 for local problems on $\Delta$-regular trees, $\Delta \in \omega$. We show that such a problem admits a…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
Integro-differential methods, currently exploited in calculus, provide an inexhaustible source of tools to be applied to a wide class of problems, involving the theory of special functions and other subjects. The use of integral transforms…