Related papers: Tukey morphisms between finite relations

For bounded pseudoconvex domains with finite type we give a precise description of the automorphism group: if an orbit of the automorphism group accumulates on at least two different points of the boundary, then the automorphism group has…

We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…

We construct a singular homology theory on the category of schemes of finite type over a Dedekind domain and verify several basic properties. For arithmetic schemes we construct a reciprocity isomorphism between the integral singular…

We introduce a framework for internal topological symmetries in quantum field theory, including "noninvertible symmetries" and "categorical symmetries". This leads to a calculus of topological defects which takes full advantage of…

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…

We give information about finite-dimensional Lie algebras and their representations for model building in 4 and 5 dimensions; e.g., conjugacy classes, types of representations, Weyl dimensional formulas, Dynkin indices, quadratic Casimir…

Uncertainty relations are fundamental in quantum mechanics. Here I propose state-independent variance-based uncertainty relations for two or more arbitrary observables in finite dimensional spaces. The uncertainty relations provide…

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

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…

The motivation comes from boson fermion correspondence. This article shows for each fermionic root there is correspondence a bosonic root, as a result we get for each Dynkin diagram of Lie Superalgebra a corresponding flip Dynkin…

We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…

For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…

The topology of digital images has been studied much in recent years, but no attempt has been made to exhaustively catalog the structure of binary images of small numbers of points. We produce enumerations of several classes of digital…

We classify small binary bibraces, using the correspondence with alternating algebras over the field F2, up to dimension eight, also determining their isomorphism classes. These finite-dimensional algebras, defined by an alternating…

We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different letters. This in particular implies that any binary language…