Related papers: Rough sets determined by tolerances

In distributionally robust optimization the probability distribution of the uncertain problem parameters is itself uncertain, and a fictitious adversary, e.g., nature, chooses the worst distribution from within a known ambiguity set. A…

This paper studies expansions of bounded distributive lattices equipped with a Galois connection. We introduce GC-frames and canonical frames for these algebras. The complex algebras of GC-frames are defined in terms of rough set…

This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…

For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure…

A well-known line of work (Barron, 1993; Breiman, 1993; Klusowski & Barron, 2018) provides bounds on the width $n$ of a ReLU two-layer neural network needed to approximate a function $f$ over the ball $\mathcal{B}_R(\mathbb{R}^d)$ up to…

Let $G$ be an $\ell$-group (which is short for ``lattice-ordered abelian group''). Baker and Beynon proved that $G$ is finitely presented iff it is finitely generated and projective. In the category $\mathcal U$ of {\it unital}…

For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…

Given a set U of alternatives, a choice (correspondence) on U is a contractive map c defined on a family Omega of nonempty subsets of U. Semantically, a choice c associates to each menu A in Omega a nonempty subset c(A) of A comprising all…

We prove an effective equidistribution theorem for orbits of certain unipotent subgroups in arithmetic quotients of perfect Lie groups with a polynomial error term. Even for semisimple quotients, our result provides the first infinite…

Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of…

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…

Background: Microscopic calculations of heavy nuclei face considerable difficulties due to the sizes of the matrices that need to be solved. Various approximation schemes have been invoked, for example by truncating the spaces, imposing…

We study the structure of the set of priority-neutral matchings. These matchings, introduced by Reny (AER, 2022), generalize stable matchings by allowing for priority violations in a principled way that enables Pareto-improvements to stable…

We define topological orthoalgebras (TOAs) and study their properties. While every topological orthomodular lattice is a TOA, the lattice of projections of a Hilbert space is an example of a lattice-ordered TOA that is not a toplogical…

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of K\'atai's orthogonality criterion.…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…

Let $W$ be a simply laced Weyl group of finite type and rank $n$. If $W$ has type $E_7$, $E_8$, or $D_n$ for $n$ even, then the root system of $W$ has subsystems of type $nA_1$. This gives rise to an irreducible Macdonald representation of…