Related papers: Testing isomorphism of circulant objects in polyno…
Let $k$ be any field and $k^s$ its separable closure. Let $X$ be an affine variety over $k$ which is isomorphic to affine $n$-space over the field extension $k^s$. Then $X$ is isomorphic to affine $n$ space over $k$.
We give a construction of a free digroup $F(X)$ on a set $X$ and formulate the halo and the group parts of $F(X)$. We prove that $F(X)$ is isomorphic to $F(Y)$ if and only if $card(X)=card(Y)$.
In this article we study the K- and L-theory of groups acting on trees. We consider the problem in the context of the fibered isomorphism conjecture of Farrell and Jones. We show that in the class of residually finite groups it is enough to…
Within a category $\mathtt{C}$, having objects $\mathtt{C}_0$, it may be instructive to know not only that two objects are non-isomorphic, but also how far from being isomorphic they are. We introduce pseudo-metrics $d:\mathtt{C}_0 \times…
In this paper, we devise two algorithms for the problem of testing $q$-monomials of degree $k$ in any multivariate polynomial represented by a circuit, regardless of the primality of $q$. One is an $O^*(2^k)$ time randomized algorithm. The…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…
We show that the epimorphism problem is solvable for targets that are virtually cyclic or a product of an Abelian group and a finite group.
Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…
In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…
It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
In this paper, we prove that the ring of polynomial invariants of the Weyl group for an indecomposable and indefinite Kac-Moody Lie algebra is generated by invariant symmetric bilinear form or is trivial depending on $A$ is symmetrizable or…
Motivated by Lusztig's $G$-stable pieces, we consider the combinatorial pieces: the pairs $(w, K)$ for elements $w$ in the Weyl group and subsets $K$ of simple reflections that are normalized by $w$. We generalize the notion of cyclic shift…
In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…