相关论文: Large intervals in the clone lattice

We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparabilty graphs and counting independent sets in…

Let K be the family of graphs on omega_1 without cliques or independent subsets of size omega_1 . We prove that: 1) it is consistent with CH that every G in K has 2^{omega_1} many pairwise non-isomorphic subgraphs, 2) the following…

A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…

We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

Critical catalytic branching random walk on d-dimensional integer lattice is investigated for all d. The branching may occur at the origin only and the start point is arbitrary. The asymptotic behavior, as time grows to infinity, is…

In the paper, we prove that in an arbitrary Delone set $X$ in $3D$ space, the subset $X_6$ of all points from $X$ at which local groups have axes of the order not greater than 6 is also a Delone set. Here, under the local group at point…

This paper focuses on a setting with observations having a cluster dependence structure and presents two main impossibility results. First, we show that when there is only one large cluster, i.e., the researcher does not have any knowledge…

The existence and stability of defect solitons in parity-time (PT) symmetric optical lattices with nonlocal nonlinearity are reported. It is found that nonlocality can expand the stability region of defect solitons. For positive or zero…

For i=1,2, let (M_i,D_i) be pairs consisting of a Cartan MASA D_i in a von Neumann algebra M_i, let atom(D_i) be the set of atoms of D_i, and let S_i be the lattice of Bures-closed D_i bimodules in M_i. We show that when M_i have separable…

The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, by using maximal orders in quaternion algebras of class…

We completely determine all semigroup varieties satysfiyng a permutational identity of length 3 that are modular elements of the lattice of all semigroup varieties. Using this result, we provide an example of a semigroup variety that is a…

Constraints from clock-comparison experiments on violations of Lorentz and CPT symmetry are investigated in the context of a general Lorentz-violating extension of the standard model. The experimental signals are shown to depend on the…

By investigating the canonical commutation rules for gravitating quantized particles in a 2+1 dimensional world it is found that these particles live on a space-time lattice. The space-time lattice points can be characterized by three…

The distribution of Abell clusters of galaxies is analysed to study the regularity of the supercluster-void network. A new geometric method sensitive to the regularity of the location of clusters is applied. We find that the…

In this study, we consider the nonlinear Sch\"odinger equation (NLS) with the zero-boundary condition on a two- or three-dimensional large finite cubic lattice. We prove that its solution converges to that of the NLS on the entire Euclidean…

Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of…

Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this…

Let $P$ be a finite poset. Let $L:=J(P)$ denote the lattice of order ideals of $P$. Let $b_i(L)$ denote the number of Boolean intervals of $L$ of rank $i$. We construct a simple graph $G(P)$ from our poset $P$. Denote by $f_i(P)$ the number…

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…