相关论文: Rough sets determined by tolerances
In this paper we present an arbitrary-order fully discrete Stokes complex on general polyhedral meshes. We enriche the fully discrete de Rham complex with the addition of a full gradient operator defined on vector fields and fitting into…
Given a countable, totally ordered commutative monoid $\mathcal{R}=(R,\oplus,\leq,0)$, with least element $0$, there is a countable, universal and ultrahomogeneous metric space $\mathcal{U}_\mathcal{R}$ with distances in $\mathcal{R}$. We…
We describe a simple deterministic $O( \varepsilon^{-1} \log \Delta)$ round distributed algorithm for $(2\alpha+1)(1 + \varepsilon)$ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$…
We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…
The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…
This paper presents a general framework for constructing reduced models that approximate the Boltzmann equation with arbitrary orders of accuracy in terms of the Knudsen number $\mathit{Kn}$, applicable to general collision models in…
The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity ({\bf LR}) is a form of ideal regularity of aperiodic patterns. Recently,…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
We consider a broad class of semilinear SPDEs with multiplicative noise driven by a finite-dimensional Wiener process. We show that, provided that an infinite-dimensional analogue of H\"ormander's bracket condition holds, the Malliavin…
Strict inequalities in mixed-integer linear optimization can cause difficulties in guaranteeing convergence and exactness. Utilizing that optimal vertex solutions follow a lattice structure we propose a rounding rule for strict inequalities…
In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…
Experimental designs that spread out points apart from each other on projections are important for computer experiments when not necessarily all factors have substantial influence on the response. We provide a theoretical framework to…
We show how a quasi-smooth derived enhancement of a Deligne-Mumford stack X naturally endows X with a functorial perfect obstruction theory in the sense of Behrend-Fantechi. This result is then applied to moduli of maps and perfect…
Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of…
Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…
The Dedekind-Birkhoff theorem for finite-height modular lattices has previously been generalized to complete modular lattices using the theory of regular coverings. In this paper, we investigate regular coverings in lattices of filters and…
In "Centre of Core Regular Double Stone Algebra" (CRDSA), many useful results are shown that begin to indicate the nearly Boolean nature of CRDSA which we focus on here. We define the node set lattice through the well known binary…
The Boolean lattice $2^{[n]}$ is the family of all subsets of $[n]=\{1,\dots,n\}$ ordered by inclusion, and a chain is a family of pairwise comparable elements of $2^{[n]}$. Let $s=2^{n}/\binom{n}{\lfloor n/2\rfloor}$, which is the average…
A Rough semiring $(T,\Delta,\nabla)$ is considered to describe a special distributive Rough semiring known as a Rough bi-Heyting algebra. A bi-Heyting algebra is an extension of boolean algebra and it is accomplished by weaker notion of…
We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…