Hilbert Spaces of Distributions Having an Orthogonal Basis of Exponentials.
Interpolation Formulas Over Finite Sets
Interpolation formulas over finite sets.
Invariance groups of finite functions and orbit equivalence of permutation groups
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...
Les graphes de transfert et la notion de graphe inverse
L'Espace Vectoriel Pseudo-Booléen Généralisé
Limit behaviour of trajectories involving subgradients of convex functions
Mahler's expansion and Boolean functions.
Minimal cycle bases of outerplanar graphs.
Některé vlastnosti nelineárních obvodu a fyzikální význam jakobiánu
Note on Hamilton Circuits and Hamilton Paths.
On Boolean partial differential equations
On cubes and dichotomic trees
On free Boolean vectors.
On maximal QROBDD’s of boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On maximal QROBDD's of Boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On networks of non-deterministic automata
On nonlinear complexity of monotone realization of a family of Boolean sums.
On positive, linear and quadratic Boolean functions
On set-valued non-Boolean functions.