Related papers: Generalized recursive atom ordering and equivalenc…
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
We propose new measures of localization and cooperativity for the analysis of atomic rearrangements. We show that for both clusters and bulk material cooperative rearrangements usually have significantly lower barriers than uncooperative…
Quasicrystals are aperiodically ordered solids that exhibit long-range order without translational periodicity, bridging the gap between crystalline and amorphous materials. Due to their lack of translational periodicity, information on…
We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…
In this work we introduce a new combinatorial notion of boundary $\Re C$ of an $\omega$-dimensional cubing $C$. $\Re C$ is defined to be the set of almost-equality classes of ultrafilters on the standard system of halfspaces of $C$, endowed…
In [1] we introduced the notion of 'structured space', i.e. a space which locally resembles various algebraic structures. In [2] and [3] we studied some cohomology theories related to these space. In this paper we continue in this…
In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…
We study the topology of circularly ordered sets. While the algebraic notion is classical, the general topological theory has received comparatively little attention. In this work we provide a self-contained topological exposition and…
In this paper, we give some generalizations the concept of element order and we study some of the properties of these generalized order. In particular, with using this generalization we derive two solvability criteria.
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
Pattern avoiding machines were recently introduced by Claesson, Ferrari and the current author to gain a better understanding of the classical $2$-stacksort problem. In this paper we generalize these devices by allowing permutations with…
We generalize the concept of $r$-point clusters of a scheme $S$ to $r$-relative clusters of a $B$-scheme $\mathcal{S}$. Define schemes $Cl_r$ that naturally parametrize the $r$-relative clusters which generalize the Kleiman's construction…
We use a hybrid Monte Carlo algorithm to simulate the shaking of spheres at different vibrational amplitudes, and find that spontaneous crystallisation occurs in specific dynamical regimes. Several crystallising transitions are typically…
General method is suggested to find non-relativistic and relativistic matrix elements of one- and two-electron operators for any number of open shells in atom, requiring neither coefficients of fractional parentage nor unit tensors. It is…
We improve upon a recent result of Culler and Dunfield on orderability of certain Dehn fillings by removing a difficult condition they required.
The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…
A novel paradigm for sorting is introduced, based upon resetting. Using simple examples, we demonstrate that sorting is achieved by resetting the velocity component(s) or orientation of the particles, rather than position. The objects to be…