Related papers: Specular sets
Unlike the relativity theory it seeks to replace, causal set theory has been interpreted to leave space for a substantive, though perhaps 'localized', form of 'becoming'. The possibility of fundamental becoming is nourished by the fact that…
We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
Whether explicit or implicit, sets are a critical part of many pieces of software. As a result, it is necessary to develop abstractions of sets for the purposes of abstract interpretation, model checking, and deductive verification.…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
We show that picture groups are directly related to maximal green sequences for valued Dynkin quivers of finite type. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without…
In this paper, generalised intuitionistic fuzzy soft sets and relations on generalised intuitionistic fuzzy soft sets are defined and a few of their properties are studied. An application of generalised intuitionistic fuzzy soft sets in…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
Most of the examples of wavelet sets are for dilation sets which are groups. We find a necessary and sufficient condition under which subspace wavelet sets exist for dilation sets of the form $A B$, which are not necessarily groups. We…
Classical sequential growth models for causal sets provide an important step towards the formulation of a quantum causal set dynamics. The covariant observables in a class of these models known as generalised percolation have been…
We introduce a generalization of the product expansion of a finite semigroup. As an application, we provide an alternative proof of the decidability of pointlike sets for pseudovarieties consisting of semigroups whose subgroups all belong…
The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…
We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.
We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…
In previous work with J. Hedges, we formalised a generalised quantifiers theory of natural language in categorical compositional distributional semantics with the help of bialgebras. In this paper, we show how quantifier scope ambiguity can…
The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…