The profile of a relational structure R is the function φR which counts for every integer n the number, possibly infinite, φR(n) of substructures of R induced on the n-element subsets, isomorphic substructures being identified. If φR takes only finite values, this is the Hilbert function of a graded algebra associated with R, the age algebra K.A(R), introduced by P. J. Cameron. In this paper, w...

The profile of a relational structure R is the function φR which counts for every integer n the number φR(n), possibly infinite, of substructures of R induced on the n-element subsets, isomorphic substructures being identified. If φR takes only finite values, this is the Hilbert function of a graded algebra associated with R, the age algebra KA(R), introduced by P. J. Cameron. In this paper we ...

It is known that the maximal ideals in the rings C(X) and C*(X) of continuous and bounded continuous functions on X, respectively, are in one-to-one correspondence with j3X. We have shown previously that the same is true for any ring A(X) between C(X) and C*(X). Here we consider the problem for rings A(X) contained in C'{X) which are complete rings of functions (that is, they contain the consta...

A new crystalline molecular sieve, denoted CIT-7, is synthesized using an imidazolium-based diquaternary organic structure directing agent (OSDA). The framework structure is determined from a combination of rotation electron diffraction and synchrotron X-ray powder diffraction data. The structure has 10 crystallographically unique tetrahedral atoms (T-atoms) in the unit cell, and can be describ...

We propose a definition for quantum Fourier transforms in settings where the algebraic structure is that of a finite field, and show that they can be performed efficiently by a quantum computer. Using these finite field quantum Fourier transforms, we obtain the strongest separation between quantum and classical query complexity known to date—specifically, we define a problem that requires Ω(2) ...

In this paper we present a novel design technique for packet switched networks. The design is based on the construction of multiple virtual rings, which enjoy the one-bridge property: the path between any two nodes is either confined to a single ring or traverses exactly two rings (passing through a single bridge node). Our best designs are constructed by using finite generalized quadrangles of...

Parameterized synthesis was recently proposed as a way to circumvent the poor scalability of current synthesis tools. The method uses cut-off results in token rings to reduce the problem to bounded distributed synthesis, and thus ultimately to a sequence of SMT problems. This solves the problem of scalability in the size of the architecture, but experiments show that the size of the specificati...

A new crystalline molecular sieve, denoted CIT-7, is synthesized using an imidazolium-based diquaternary organic structure directing agent (OSDA). The framework structure is determined from a combination of rotation electron diffraction and synchrotron X-ray powder diffraction data. The structure has 10 crystallographically unique tetrahedral atoms (T-atoms) in the unit cell, and can be describ...

In this note we study some topological properties of bounded sets and Bourbaki-bounded sets. Also we introduce two types of Bourbaki-bounded homomorphisms on topological groups  including, n$-$Bourbaki-bounded homomorphisms and$hspace{1mm}$ B$-$Bourbaki-bounded homomorphisms. We compare them to each other and with the class of continuous homomorphisms. So, two topologies are presented on them a...

We analyze in this paper the stability of two types of timed-token rings: the existing Fiber Distributed Data Interface (FDDI) token ring protocol, and a new variant of the FDDI that we propose. The FDDI supports two classes of traac: synchronous and asynchronous. The time constraint mechanism of FDDI guarantees the transmission delay of synchronous traac: a Target Token Rotation Time (TTRT) be...