Related papers: Perfect congruences on bisimple $\omega$-semigroup…

We consider a set $SPG(\mathcal{A})$ of pure split states on a quantum spin chain $\mathcal{A}$ which are invariant under the on-site action $\tau$ of a finite group $G$. For each element $\omega$ in $SPG(\mathcal{A})$ we can associate a…

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

A perfect matching in a 4-uniform hypergraph is a subset of $\lfloor\frac{n}{4}\rfloor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than…

A discrete subset $S$ of a topological group $G$ is called a {\it suitable set} for $G$ if $S\cup \{e\}$ is closed in $G$ and the subgroup generated by $S$ is dense in $G$, where $e$ is the identity element of $G$. In this paper, the…

We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…

We show that if G is a split semisimple algebraic group over a model complete field K, then the groups G(K) and G(K)' (the commutator group which is a ``Chevalley group'' as for example the group PSL_2(K)) are model complete as well.

In this paper, it is shown that every right $\omega$-narrow strongly topological gyrogroup $G$ is right $\omega$-balanced by applying the gyrosemidirect product groups. Then we investigate the class of $\sigma$-compact strongly topological…

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

In this paper we introduce perfectly supportable semigroups and prove that they are \sigma-discrete in each Hausdorff shift-invariant topology. The class of perfectly supportable semigroups includes each subsemigroup S of the semigroup…

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

In this paper we prove first a general theorem on semiorthogonal decompositions in derived categories of coherent sheaves for flat families over a smooth base. Based on the results of math.AG/0510670, we then show that the derived…

Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…

A semigroup $\langle C\rangle$ in $\mathbb{N}^n$ is a gluing of $\langle A\rangle$ and $\langle B\rangle$ if its finite set of generators $C$ splits into two parts, $C=k_1A\sqcup k_2B$ with $k_1,k_2\geq 1$, and the defining ideals of the…

A DR-semigroup $S$ (also known as a reduced E-semiabundant or reduced E-Fountain semigroup) is here viewed as a semigroup equipped with two unary operations $D,R$ satisfying finitely many equational laws. Examples include DRC-semigroups…

Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on…

Let $X$ be a nonempty set and let $T(X)$ be the full transformation semigroup on $X$. The main objective of this paper is to study the subsemigroup $\overline{\Omega}(X, Y)$ of $T(X)$ defined by \[\overline{\Omega}(X, Y) = \{f\in T(X)\colon…