Related papers: Very many term clones in a very small variety

We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-semidistributive and residually less than some finite cardinal, then…

A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

For Fano varieties of various singularities such as canonical and terminal, we construct examples with large Fano index. By low-dimensional evidence, we conjecture that our examples have the largest Fano index for all dimensions.

In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…

We give three examples of large intervals in the lattice of (local) clones on an infinite set X, by exhibiting clones C_1, C_2, C_3 such that: (1) the interval [C_1, O] in the lattice of local clones is (as a lattice) isomorphic to {0,1,2,…

For a triple of complex hyperplane arrangements, there is a well-known long exact sequence relating the cohomology of the complements. We observe that this result extends to certain local coefficient systems, and use this extension to study…

In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.

We introduce a new class of categories generalizing locally presentable ones. The distinction does not manifest in the abelian case and, assuming Vopenka's principle, the same happens in the regular case. The category of complete partial…

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

In this work, the lattice of varieties of semigroups and the lattice of varieties of I-semigroups (a common setting for both the variety of completely regular semigroups and the variety of inverse semigroups) are studied with respect to the…

Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…

We first determine the maximal clones on a set X of infinite regular cardinality which contain all permutations but not all unary functions, extending a result of Heindorf's for countably infinite X. If |X| is countably infinite or weakly…

We give an abstract definition of a hypertoric variety, generalizing the existing constructive definition. We construct a hypertoric variety associated with any zonotopal tiling, and we show that the previously known examples are exactly…

An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…

A two-parameter family of exchangeable partitions with a simple updating rule is introduced. The partition is identified with a randomized version of a standard symmetric Dirichlet species-sampling model with finitely many types. A…

We define a new finite type invariant for stably homeomorphic class of curves on compact oriented surfaces without boundaries and extend to a regular homotopy invariant for spherical curves.

We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges…

We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.

We give a bound on the number of weighted real forms of a complex variety with finite automorphism group, where the weight is the inverse of the number of automorphisms of the real form. We give another bound involving the Sylow 2-subgroup…