English
Related papers

Related papers: Relationship between the second type of covering-b…

200 papers

We give properties of strict pseudocontractions and demicontractions defined on a Hilbert space, which constitute wide classes of operators that arise in iterative methods for solving fixed point problems. In particular, we give necessary…

Optimization and Control · Mathematics 2023-07-17 Andrzej Cegielski

In this paper, we study some properties of the closure operator in the Mac\'ias topology on infinite integral domains. Moreover, under certain conditions, we present topological proofs of the infiniteness of maximal ideals and…

Algebraic Topology · Mathematics 2025-06-27 Jhixon Macías , Reyes Ortiz

Contraction$^*$-depth is considered to be one of the analogues of graph tree-depth in the matroid setting. In this paper, we investigate structural properties of contraction$^*$-depth of matroids representable over finite fields and…

Combinatorics · Mathematics 2025-01-17 Jakub Gajarský , Kristýna Pekárková , Michał Pilipczuk

We prove some unconditional cases of the Existential Closedness problem for the modular $j$-function. For this, we show that for any finitely generated field we can find a "convenient" set of generators. This is done by showing that in any…

Logic · Mathematics 2022-10-06 Vahagn Aslanyan , Sebastian Eterović , Jonathan Kirby

Given a finite set $E$ and an operator $\sigma:2^{E}\longrightarrow2^{E}$, two sets $X,Y\subseteq E$ are \textit{cospanning} if $\sigma\left( X\right) =\sigma\left( Y\right) $. Corresponding \textit{cospanning equivalence relations} were…

Combinatorics · Mathematics 2021-07-20 Kempner Yulia , Vadim E. Levit

We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…

An analysis of extension of Hamiltonian operators from lower order to higher order of matrix paves a way for constructing Hamiltonian pairs which may result in hereditary operators. Based on a specific choice of Hamiltonian operators of…

solv-int · Physics 2016-09-08 Wen-Xiu Ma , Maxim Pavlov

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…

Classical Analysis and ODEs · Mathematics 2007-09-24 Fatma Tasdelen , Ali Olgun , Gulen Bascanbaz-Tunca

We consider the problem of minimizing the composition of a nonsmooth function with a smooth mapping in the case where the proximity operator of the nonsmooth function can be explicitly computed. We first show that this proximity operator…

Optimization and Control · Mathematics 2023-08-29 Gilles Bareilles , Franck Iutzeler , Jérôme Malick

We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked…

Combinatorics · Mathematics 2022-12-09 Hakan Guler

In this paper, we introduce the concept of several products of rough finite state machines. We establish their relationships through coverings and investigate some algebraic properties for these products.

Logic · Mathematics 2016-11-26 S. P. Tiwari , Shambhu Sharan

We show that for every orthomodular poset P of finite height there can be defined two operators forming an adjoint pair with respect to an order-like relation defined on the power set of P. This enables us to introduce the so-called…

Logic · Mathematics 2022-04-25 Ivan Chajda , Helmut Länger

Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…

General Mathematics · Mathematics 2015-02-24 M. Abo-Elhamayel

We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than…

Combinatorics · Mathematics 2014-03-26 Robert Brijder , Hendrik Jan Hoogeboom

In this paper we prove some results on the covering morphisms of internal groupoids. We also give a result on the coverings of the crossed modules of groups with operations.

Category Theory · Mathematics 2016-01-29 H. Fulya Akız , Nazmiye Alemdar , Osman Mucuk , Tunçar Şahan

In this paper, we propose novel methods for constructing uninorms using two comparable closure operators or, alternatively, two comparable interior operators on bounded lattices. These methods are developed under the necessary and…

Functional Analysis · Mathematics 2025-05-08 Zhenyu Xiu , Xu Zheng

In this paper, we consider the boundedness of a class of sublinear operators and their commutators by with rough kernels associated with Calderon-Zygmund operator, Hard-Littlewood maximal operator, fractional integral operator, fractional…

Functional Analysis · Mathematics 2018-04-04 Ferit Gurbuz

We propose a generalization of continuous lattices and domains through the concept of enriched closure space, defined as a closure space equipped with a preclosure operator satisfying some compatibility conditions. In this framework we are…

Logic in Computer Science · Computer Science 2017-05-16 Paul Poncet

We relate two conjectures that play a central role in the reported proof of Rota's Conjecture. Let $\mathbb F$ be a finite field. The first conjecture states that: the branch-width of any $\mathbb F$-representable $N$-fragile matroid is…

Combinatorics · Mathematics 2019-09-09 Jim Geelen , Florian Hoersch