相关论文: Constructions of Macaulay Posets and Macaulay Ring…
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
The consecutive pattern poset is the infinite partially ordered set of all permutations where $\sigma\le\tau$ if $\tau$ has a subsequence of adjacent entries in the same relative order as the entries of $\sigma$. We study the structure of…
We study rings of integral modular forms for congruence subgroups as modules over the ring of integral modular forms for the full modular group. In many cases these modules are free or decompose at least into well-understood pieces. We…
The kinetics of aggregation in a monolayer of magnetic particles are studied using stochastic dynamics computer simulations. At low densities (<8% coverage) the equilibrium structure is made up of chains and rings; the primary mechanisms by…
We show in simulations that a rich variety of novel orderings such as pinwheel and star states can be realized for colloidal molecular crystal mixtures at rational ratios of the number of colloids to the number of minima from an underlying…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
We show that exchangeable structures such as Polya urn model and Chinese restaurant process can be constructed from sets with a real number of elements. From this construction, the exchangeability of these structures becomes obvious and the…
A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…
We consider the simultaneous movement of finitely many colored points in space, calling it a spatial sorting process. The name suggests a purpose that drives the collection to a configuration of increased or decreased order. Mapping such a…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
We characterize Cohen-Macaulay and Gorenstein rings obtained from certain types of convex body semigroups. Algorithmic methods to check if a polygonal or circle semigroup is Cohen-Macaulay/Gorenstein are given. We also provide some families…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…
Hepworth, Willerton, Leinster and Shulman introduced the magnitude homology groups for enriched categories, in particular, for metric spaces. The purpose of this paper is to describe the magnitude homology group of a metric space in terms…
The structure of topological spaces is analysed here through the lenses of fibrous preorders. Each topological space has an associated fibrous preorder and those fibrous preorders which return a topological space are called spacial. A…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…