Related papers: Approximation of integration over finite groups, d…
For any subgroup $G$ of the symmetric group $\mathcal{S}_n$ on $n$ symbols, we present results for the uniform $\mathcal{C}^k$ approximation of $G$-invariant functions by $G$-invariant polynomials. For the case of totally symmetric…
We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…
We investigate the minimal number of generators $\mu$ and the depth of divisorial ideals over normal semigroup rings. Such ideals are defined by the inhomogeneous systems of linear inequalities associated with the support hyperplanes of the…
A difference set with parameters $(v, k, \lambda)$ is a subset $D$ of cardinality $k$ in a finite group $G$ of order $v$, such that the number $\lambda$ of occurrences of $g \in G$ as the ratio $d^{-1}d'$ in distinct pairs $(d, d')\in…
Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…
We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…
We consider factorizations $G=XY$ where $G$ is a general group, $X$ and $Y$ are normal subsets of $G$ and any $g\in G$ has a unique representation $g=xy$ with $x\in X$ and $y\in Y$. This definition coincides with the customary and…
This paper introduces the notion of an excellent quotient, which is stronger than a universal geometric quotient. The main result is that for an action of a connected solvable group $G$ on an affine scheme Spec$(R)$ there exists a…
Let X be compact abelian group and G its dual (a discrete group). If B is an infinite subset of G, let C_B be the set of all x in X such that <phi(x) : phi \in B> converges to 1. If F is a free filter on G, let D_F be the union of all the…
We establish that temporal averaging over multiple observations is the degenerate case of algebraic group action with the trivial group $G=\{e\}$. A General Replacement Theorem proves that a group-averaged estimator from one snapshot…
For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has…
Let A denote the algebraic closure of the rationals Q in the complex numbers C. Suppose G is a torsion-free group which contains a congruence subgroup as a normal subgroup of finite index and denote by U(G) the C-algebra of closed densely…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
For a finite group $G$, we denote by $c(G)$, the minimal degree of faithful representation of $G$ by quasi-permutation matrices over the complex field $\mathbb{C}$. For an irreducible character $\chi$ of $G$, the codegree of $\chi$ is…
The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…
We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…
Let g:X -> Y be a smooth (i.e. C^\infty differentiable) map between two smooth manifolds. In analogy with the case of complex polynomial functions, we say that y_0 in Y is a typical value of g if there exists an open neighbourhood U of y_0…
A dissociation set in a graph is a set of vertices inducing a subgraph of maximum degree at most $1$. Computing the dissociation number ${\rm diss}(G)$ of a given graph $G$, defined as the order of a maximum dissociation set in $G$, is…
Let $k$ be a nonperfect field of characteristic $2$. Let $G$ be a $k$-split simple algebraic group of type $E_6$ (or $G_2$) defined over $k$. In this paper, we present the first examples of nonabelian non-$G$-completely reducible…
Let A be an associative algebra of arbitrary dimension over a field F and G a finite soluble group of automorphisms of A oforder n, prime to the characteristic of F. We prove that if the fixed-point subalgebra of A under the action of G…