Related papers: Set-reconstructibility of Post classes
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a…
We prove that complete Boolean algebras can be reconstructed from any locally moving subgroup of their full automorphism group. We use this theorem in order to prove that linear orders and circles can be reconstructed from small subgroups…
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…
Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…
Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We propose a general approach to construct cryptographic significant Boolean functions of $(r+1)m$ variables based on the additive decomposition $\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$ of the finite field $\mathbb{F}_{2^{(r+1)m}}$,…
Reconstruction of density functions and their characteristic functions by radial basis functions with scattered data points is a popular topic in the theory of pricing of basket options. Such functions are usually entire or admit an…
Though modern neural networks have achieved impressive performance in both vision and language tasks, we know little about the functions that they implement. One possibility is that neural networks implicitly break down complex tasks into…
We study generalized permutohedra and supermodular functions. Specifically we analyze decomposability and irreducibility for these objects and establish some asymptotic behavior. We also study a related problem on irreducibility for…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
In this short \'etude, we observe that the full structure of a recollement on a stable infinity-category can be reconstructed from minimal data: that of a reflective and coreflective full subcategory. The situation has more symmetry than…
Every right adjoint functor between presentable $\infty$-categories is shown to decompose canonically as a coreflection, followed by, possibly transfinitely many, monadic functors. Furthermore, the coreflection part is given a presentation…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
The space of constructible functions form a dense subspace of the space of generalized valuations. In this note we prove a somewhat stronger property that the sequential closure, taken sufficiently many (in fact, infinitely many) times, of…
Let X be a linearly ordered set of arbitrary size (finite or infinite). Natural functions on such a set one can define using the linear order include maximum, minimum and median functions. While it is clear what the clone generated by the…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…
An element $g$ in a group $G$ is called reversible if $g$ is conjugate to $g^{-1}$ in $ G $. An element $g$ in $G$ is strongly reversible if $ g $ is conjugate to $g^{-1}$ by an involution in $G$. The group of affine transformations of…
Categories are coreflectively embedded in multicategories via the "discrete cocone" construction, the right adjoint being given by the monoid construction. Furthermore, the adjunction lifts to the "cartesian level": preadditive categories…