Related papers: Hypomorphic Sperner systems and nonreconstructible…
Splines can be constructed by convolving the indicator function of a cell whose shifts tessellate $\R^k$. This paper presents simple, non-algebraic criteria that imply that, for regular shift-invariant tessellations, only a small subset of…
Let c be the cardinality of the continuum. We give a family of pairwise incomparable clones (on a countable base set) 2^c members, all with the same unary fragment, namely the set of all unary operations. We also give, for each n, a family…
We analyze in detail three classes of isomondromy deformation problems associated with integrable systems. The first two are related to the scaling invariance of the $n\times n$ AKNS hierarchies and the Gel'fand-Dikii hierarchies. The third…
We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…
In this note we consider several kind of partition functions of one-dimensional models with nearest - neighbor interactions $I_n, n\in \mathbf{Z}$ and spin values $\pm 1$. We derive systems of recursive equations for each kind of such…
We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…
Two models of candidates for hereditary symmetry operators are proposed and thus many nonlinear systems of evolution equations possessing infinitely many commutative symmetries may be generated. Some concrete structures of hereditary…
The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…
We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…
Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…
We consider A-hypergeometric functions associated to normal sets in the plane. We give a classification of all point configurations for which there exists a parameter vector such that the associated hypergeometric function is algebraic. In…
We define an analogue of the Baernstein star function for a meromorphic function f in several complex variables. This function is subharmonic on the upper half-plane and encodes some of the main functionals attached to f.We then…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…
This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
We classify and construct all multiplicity-free plethystic products of Schur functions. We also compute many new (infinite) families of plethysm coefficients, with particular emphasis on those near maximal in the dominance ordering and…
Multivariate functions emerge naturally in a wide variety of data-driven models. Popular choices are expressions in the form of basis expansions or neural networks. While highly effective, the resulting functions tend to be hard to…