On the Cohen–Lusk theorem

Let G be a finite group and X be a G-space. For a map f: X → ℝ ^m , the partial coincidence set A(f, k), k ≤ |G|, is the set of points x ∈ X such that there exist k elements g ₁,…, g _k of the group G, for which f(g ₁ x) = ⋅⋅⋅ = f(g _k x) holds. We prove that the partial coincidence set is nonempty for G = ℤ _p ⁿ under some additional assumptions. Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 8, pp. 61–67, 2007.     

Observable actions of algebraic groups

Let G be an affine algebraic group and let X be an affine algebraic variety. An action G × X → X is called observable if for any G-invariant, proper, closed subset Y of X there is a nonzero invariant f ∈ \Bbbk\Bbbk [X] ^G such that f| _Y = 0. We characterize this condition geometrically as follows. The action G × X → X is observable if and only if:

On the Cauchy difference on normed spaces

LetX be a real linear normed space, (G, +) be a topological group, andK be a discrete normal subgroup ofG. We prove that if a continuous at a point or measurable (in the sense specified later) functionf:X →G fulfils the condition:f(x +y) -f(x) -f(y) ∈K whenever ‖x‖ = ‖y‖, then, under some additional assumptions onG,K, andX, there esists a continuous additive functionA :X →G such thatf(x) -A(x) ∈K.     

Uniformity over primes of tamely ramified splittings

We fix a prime p and let f(X) vary over all monic integer polynomials of fixed degree n. Given any possible shape of a tamely ramified splitting of p in an extension of degree n, we prove that there exists a rational function φ(X)∈ℚ(X) such that the density of the monic integer polynomials f(X) for which the splitting of p has the given shape in ℚ[X]/f(X) is φ(p) (here reducible polynomials can be neglected). As a corollary, we prove that, for p≥n, the density of irreducible monic polynomials of degree n in ℤ _p [X] is the value at p of a rational function φ _n (X)∈ℚ(X). All rational functions involved are effectively computable. Received: 15 September 1998 / Revised version: 21 October 1999     

Cycles in Partially Square Graphs

. In this work we consider finite undirected simple graphs. If G=(V,E) is a graph we denote by α(G) the stability number of G. For any vertex x let N[x] be the union of x and the neighborhood N(x). For each pair of vertices ab of G we associate the set J(a,b) as follows. J(a,b)={u∈N[a]∩N[b]∣N(u)⊆N[a]∪N[b]}. Given a graph G, its partially squareG ^* is the graph obtained by adding an edge uv for each pair u,v of vertices of G at distance 2 whenever J(u,v) is not empty. In the case G is a claw-free graph, G ^* is equal to G ². If G is k-connected, we cover the vertices of G by at most ⌈α(G ^*)/k⌉ cycles, where α(G ^*) is the stability number of the partially square graph of G. On the other hand we consider in G ^* conditions on the sum of the degrees. Let G be any 2-connected graph and t be any integer (t≥2). If ∑ _{x ∈ S} deg _G (x)≥|G|, for every t-stable set S⊆V(G) of G ^* then the vertex set of G can be covered with t−1 cycles. Different corollaries on covering by paths are given. Received: January 22, 1997 Final version received: February 15, 2000     

Nonstandard arithmetic of iterated polynomials

LetK be an algebraic number field of finite degree andf(X,T) a polynomial overK. For eachφ(X)∈Z[X], we denote byE(φ) the set of all integersa with φ ^m (a) =φ ⁿ (a) for somem≠n. In this paper, we give a condition for a polynomialφ(X)∈Z[X] to satisfy the following; If forn∈N, there existr∈K anda∈Z−E(φ) such thatf r, φ ^m (a)=0, then there exists a rational functiong(X) overK andk∈N such thatf(g(T)), φ ^k (T))=0 .     

Restricted Elasticity and Rings of Integer-Valued Polynomials Determined by Finite Subsets

Let D be an integral domain such that Int(D) ≠ K[X] where K is the quotient field of D. There is no known example of such a D so that Int(D) has finite elasticity. If E is a finite nonempty subset of D, then it is known that Int(E, D) = {f(X) ∈ K[X] | f(e) ∈ D for all e ∈ E} is not atomic. In this note, we restrict the notion of elasticity so that it is applicable to nonatomic domains. For each real number r ≥ 1, we produce a ring of integer-valued polynomials with restricted elasticity r. We further show that if D is a unique factorization domain and E is finite with |E| > 1, then the restricted elasticity of Int(E, D) is infinite.     

Principal bundles whose restrictions to a curve are isomorphic

Let X be a normal projective variety defined over an algebraically closed field k. Let |O _X (1)| be a very ample invertible sheaf on X. Let G be an affine algebraic group defined over k. Let E _G and F _G be two principal G-bundles on X. Then there exists an integer n > > 0 (depending on E _G and F _G ) such that if the restrictions of E _G and F _G to a curve C ∈ |O _X (n)| are isomorphic, then they are isomorphic on all of X.     

Algebraic Independence by Approximation Method (II)

Let f (x) be a continued fraction with elements a _n x, where coefficients a _n are positive algebraic numbers. Using the criterion of [l] for any nonzero real algebraic numbers α₁,...,α_s with distinct absolute values the algebraic independence of the values f(α₁), ..., f(α_s) is proved under certain assumption concerning only with a _n . For some transcendental numbers ξ the algebraic independence of values f(ξ^j)(j∈ℤ) is also established. Received March 27, 1998, Accepted September 28, 1998     

On the sum of the reciprocals of cycle lengths in sparse graphs

For a graphG let ℒ(G)=Σ{1/k contains a cycle of lengthk}. Erdős and Hajnal [1] introduced the real functionf(α)=inf {ℒ (G)|E(G)|/|V(G)|≧α} and suggested to study its properties. Obviouslyf(1)=0. We provef (k+1/k)≧(300k logk)⁻¹ for all sufficiently largek, showing that sparse graphs of large girth must contain many cycles of different lengths.     

A Class of Multiplier Hopf Algebras

We compute the Drinfel’d double for the bicrossproduct multiplier Hopf algebra A = k[G] ⋊ K(H) associated with the factorization of an infinite group M into two subgroups G and H. We also show that there is a basis-preserving self-duality structure for the multiplier Hopf algebra A = k[G] ⋊ K(H) if there is a factor-reversing group isomorphism. Presented by A. Verschoren.     

Aspects of the conjugacy class structure of simple algebraic groups

Let G be an adjoint simple algebraic group over an algebraically closed field of characteristic p; let Φ be the root system of G, and take t∈ℕ. Lawther has proven that the dimension of the set G _[t]={g∈G:g ^t =1} depends only on Φ and t. In particular the value is independent of the characteristic p; this was observed for t small and prime by Liebeck. Since G _[t] is clearly a disjoint union of conjugacy classes the question arises as to whether a similar result holds if we replace G _[t] by one of those classes. This paper provides a partial answer to that question. A special case of what we have proven is the following. Take p,q to be distinct primes and G _p and G _q to be adjoint simple algebraic groups with the same root system and over algebraically closed fields of characteristic p and q respectively. If s∈G _p has order q then there exists an element u∈G _q such that o(u)=o(s) and dimu^G_q=dims^G_p\dim u^{G_{q}}=\dim s^{G_{p}} .     

The Convexity Number of a Graph

 For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented. Received: August 19, 1998 Final version received: May 17, 2000     

Restricted Elasticity and Rings of Integer-Valued Polynomials Determined by Finite Subsets

Let D be an integral domain such that Int(D) ≠ K[X] where K is the quotient field of D. There is no known example of such a D so that Int(D) has finite elasticity. If E is a finite nonempty subset of D, then it is known that Int(E, D) = {f(X) ∈ K[X] | f(e) ∈ D for all e ∈ E} is not atomic. In this note, we restrict the notion of elasticity so that it is applicable to nonatomic domains. For each real number r ≥ 1, we produce a ring of integer-valued polynomials with restricted elasticity r. We further show that if D is a unique factorization domain and E is finite with |E| > 1, then the restricted elasticity of Int(E, D) is infinite. Part of this work was completed while the first author was on an Academic Leave granted by the Trinity University Faculty Development Committee.     

Bounds on global secure sets in cactus trees

Let G = (V, E) be a graph. A global secure set SD ⊆ V is a dominating set which satisfies the condition: for all X ⊆ SD, |N[X] ∩ SD| ≥ | N[X] − SD|. A global defensive alliance is a set of vertices A that is dominating and satisfies a weakened condition: for all x ∈ A, |N[x] ∩ A| ≥ |N[x] − A|. We give an upper bound on the cardinality of minimum global secure sets in cactus trees. We also present some results for trees, and we relate them to the known bounds on the minimum cardinality of global defensive alliances.     

Infinite injective transformations whose centralizers have simple structure

For an infinite set X, denote by Γ(X) the semigroup of all injective mappings from X to X under function composition. For α ∈ Γ(X), let C(α) = {β ∈ g/g(X): αβ = βα} be the centralizer of α in Γ(X). The aim of this paper is to determine those elements of Γ(X) whose centralizers have simple structure. We find α ∈ (X) such that various Green's relations in C(α) coincide, characterize α ∈ Γ(X) such that the $ \mathcal{J} $ \mathcal{J} -classes of C(α) form a chain, and describe Green's relations in C(α) for α with so-called finite ray-cycle decomposition. If α is a permutation, we also find the structure of C(α) in terms of direct and wreath products of familiar semigroups.     

Orbits and invariants of visible group actions

We consider actions G?×?X?→?X of the affine, algebraic group G on the irreducible, affine, variety X. If [k[X] ^G ]?=?[k[X]] ^G we call the action visible. Here [A] denotes the quotient field of the integral domain A. If the action is not visible we construct a G-invariant, birational morphism φ: Z?→?X such that G?×?Z?→?Z is a visible action. We use this to obtain visible open subsets U of X. We also discuss visibility in the presence of other desirable properties: What if G?×?X?→?X is stable? What if there is a semi-invariant f ∈ k[X] such that G?×?X _f ?→?X _f is visible? What if X is locally factorial? What if G is reductive?     

Fourier Analysis of Semistable Distributions

We consider the generalized convolution powers G _α ^*u (x) of an arbitrary semistable distribution function G _α (x) of exponent α∈(0,2), and prove that for all j, k∈{0,1,2,…} and u>0 the derivatives G _α ^(k,j)(x;u)=∂ ^k+j G _α ^*u (x)/∂ x ^k ∂ u ^j , x∈ℝ, are of bounded variation on the whole real line ℝ. The proof, along with an integral recursion in j, is new even in the special case of stable laws, and the result provides a framework for possible asymptotic expansions in merge theorems from the domain of geometric partial attraction of semistable laws. An erratum to this article can be found at     

Distinguishing labeling of the actions of almost simple groups

Suppose Γ is a group acting on a set X, written as (Γ,X). An r-labeling f: X→{1,2, ..., r} of X is called distinguishing for (Γ,X) if for all σ∈Γ,σ≠1, there exists an element x∈X such that f(x)≠f(x ^σ ). The distinguishing number d(Γ,X) of (Γ,X) is the minimum r for which there is a distinguishing r-labeling for (Γ,X). If Γ is the automorphism group of a graph G, then d(Γ,V (G)) is denoted by d(G), and is called the distinguishing number of the graph G. The distinguishing set of Γ-actions is defined to be D*(Γ)={d(Γ,X): Γ acts on X}, and the distinguishing set of Γ-graphs is defined to be D(Γ)={d(G): Aut(G)≅Γ}. This paper determines the distinguishing set of Γ-actions and the distinguishing set of Γ-graphs for almost simple groups Γ.     

Karhunen-Loève expansions of <Emphasis Type="Italic">α</Emphasis>-Wiener bridges

We study Karhunen-Loève expansions of the process(X _t ^(α)) _t∈[0,T) given by the stochastic differential equation $ dX_t^{(\alpha )} = - \frac{\alpha } {{T - t}}X_t^{(\alpha )} dt + dB_t ,t \in [0,T) $ dX_t^{(\alpha )} = - \frac{\alpha } {{T - t}}X_t^{(\alpha )} dt + dB_t ,t \in [0,T) , with the initial condition X ₀^(α) = 0, where α > 0, T ∈ (0, ∞), and (B _t )t≥0 is a standard Wiener process. This process is called an α-Wiener bridge or a scaled Brownian bridge, and in the special case of α = 1 the usual Wiener bridge. We present weighted and unweighted Karhunen-Loève expansions of X ^(α). As applications, we calculate the Laplace transform and the distribution function of the L ²[0, T]-norm square of X ^(α) studying also its asymptotic behavior (large and small deviation).