Related papers: Formal construction of some exchangeable structure…
The $2n$ dimensional manifold with two mutually commutative operators of differentiation is introduced. Nontrivial multidimensional integrable systems connected with arbitrary graded (semisimple) algebras are constructed. The general…
A systematic procedure to numerically compute a horseshoe map is presented. This new method uses piecewise functions and expresses the required operations by means of elementary transformations, such as translations, scalings, projections…
A combinatorial model of molecular conformational space that was previously developped (J. Gabarro-Arpa, Comp. Biol. and Chem. 27, (2003) 153-159), had the drawback that structures could not be properly embedded beacause it lacked explicit…
Extreme deformation can drastically morph a structure from one structural form into another. Programming such deformation properties into the structure is often challenging and in many cases an impossible task. The morphed forms do not hold…
A simple model for the formation of a complex organism is introduced. Individuals can communicate and specialize, leading to an increase in productivity. If there are limits to the capacity of individuals to communicate with other…
Interconnected dynamic systems are a pervasive component of our modern infrastructures. The complexity of such systems can be staggering, which motivates simplified representations for their manipulation and analysis. This work introduces…
We present a comprehensive survey of constructions of the real numbers (from either the rationals or the integers) in a unified fashion, thus providing an overview of most (if not all) known constructions ranging from the earliest attempts…
We investigate dynamic reconfigurable component-based systems whose architectures are described by formulas of Propositional Configuration Logics. We present several examples of reconfigurable systems based on well-known architectures, and…
In this paper, we list several interesting structures of cyclotomic polynomials: specifically relations among blocks obtained by suitable partition of cyclotomic polynomials. We present explicit and self-contained proof for all of them,…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…
In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding…
The classical work of Feferman Vaught gives a powerful, constructive analysis of definability in (generalized) product structures, and certain associated enriched Boolean structures. %structures in terms of definability in the component…
By Poissonization of Jacobi structures on real three-dimensional Lie groups $\mathbf{G}$ and using the realizations of their Lie algebras, we obtain integrable bi-Hamiltonian systems on $\mathbf{G}\otimes \mathbb{R}$.
Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.
Inspired by the group structure on $S^1/ \bbZ$, we introduce a weak hopfish structure on an irrational rotation algebra $A$ of finite Fourier series. We consider a class of simple $A$-modules defined by invertible elements, and we compute…
Exchangeable arrays are natural tools to model common forms of dependence between units of a sample. Jointly exchangeable arrays are well suited to dyadic data, where observed random variables are indexed by two units from the same…
We study random relational structures that are \emph{relatively exchangeable}---that is, whose distributions are invariant under the automorphisms of a reference structure $\mathfrak{M}$. When $\mathfrak{M}$ has {\em trivial definable…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…
Let $X$ be a variety over a complete nontrivially valued field $K$. We construct an algebraizable formal model for the analytification of $X$ in the case $X$ admits a closed embedding into a toric variety. By algebraizable we mean that the…