Related papers: Set-reconstructibility of Post classes
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…
We develop the theory of recollements in a stable $\infty$-categorical setting. In the axiomatization of Beilinson, Bernstein and Deligne, recollement situations provide a generalization of Grothendieck's "six functors" between derived…
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…
We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…
In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
We prove some results on the structure of certain classes of integral fusion categories and semisimple Hopf algebras under restrictions on the set of its irreducible degrees.
Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…
Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…
We show that Boolean functions expressible as monotone disjunctive normal forms are PAC-evolvable under a uniform distribution on the Boolean cube if the hypothesis size is allowed to remain fixed. We further show that this result is…
Given a clone C on a set A, we characterize the clone of operations on A which are local term operations of every ultrapower of the algebra $(A; C)$.
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a…
We prove that a polynomial Julia set which is a finitely irreducible continuum is either an arc or an indecomposable continuum. For the more general case of rational functions, we give a topological model for the dynamics when the Julia set…
Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', and we give a…
In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…