Related papers: Relationship between the second type of covering-b…
We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…
We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…
This work is devoted to the advanced study of Roper--Suffridge type extension operators. For a given non-normalized spirallike function (with respect to an interior or boundary point) on the open unit disk of the complex plane, we construct…
We examine double successive approximations on a set, which we denote by $L_2L_1, \ U_2U_1, U_2L_1,$ $L_2U_1$ where $L_1, U_1$ and $L_2, U_2$ are based on generally non-equivalent equivalence relations $E_1$ and $E_2$ respectively, on a…
We generalize the notion of a crossed module of groups to that of a crossed module of racks. We investigate the relation to categorified racks, namely strict 2-racks, and trunk-like objects in the category of racks, generalizing the…
We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…
In this paper, we present a brief tutorial on reduced order model (ROM) closures. First, we carefully motivate the need for ROM closure modeling in under-resolved simulations. Then, we construct step by step the ROM closure model by…
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
We introduce the concept of a soft aura topological space $(X, \tilde{\tau}, \mathfrak{a}_E)$, obtained by equipping a soft topological space $(X, \tilde{\tau}, E)$ with a soft scope function $\mathfrak{a}_E : X \to \tilde{\tau}$ satisfying…
This contribution compiles the benefits of lattice symmetry in the context of closed orbit correction. A symmetric arrangement of BPMs and correctors results in structured orbit response matrices of Circulant or block Circulant type. These…
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…
We define a closure operation for ideals in a commutative ring which has all the good properties of solid closure (at least in the case of equal characteristic) but such that also every ideal in a regular ring is closed. This gives in…
Given a set of objects with durations (jobs) that cover a base region, can we schedule the jobs to maximize the duration the original region remains covered? We call this problem the sensor cover problem. This problem arises in the context…
We give some applications of closure operators in category of groups and link them with the join problem of subnormal subgroups.
We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems of a fixed…
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…
A celebrated 1922 theorem of Kuratowski states that there are at most 14 distinct sets arising from applying the operations of complementation and closure, any number of times, in any order, to a subset of a topological space. In this paper…
In this note, we show some improvements for Theorem 7 and Example 8 in Shiping Wang[Information Sciences 263(1), 186-197, 2014]. Concretely, we study further the sixth lower and upper approximations of sets for covering approximation…