A remark on a theorem by Claire Amiot

Claire Amiot has classified the connected triangulated k-categories with finitely many isoclasses of indecomposables satisfying suitable hypotheses. We remark that her proof shows that these triangulated categories are determined by their underlying k-linear categories. We observe that, if the connectedness assumption is dropped, the triangulated categories are still determined by their underlying k-categories together with the action of the suspension functor on the set of isoclasses of indecomposables.     

On deep holes of standard Reed-Solomon codes

Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For the standard Reed-Solomon codes [p-1, k]p with p a prime, Cheng and Murray conjectured in 2007 that there is no other deep holes except the trivial ones. In this paper, we show that this conjecture is not true. In fact, we find a new class of deep holes for standard Reed-Solomon codes [q-1, k]q with q a power of the prime p. Let q≥4 and 2≤k≤q-2. We show that the received word u is a deep hole if its Lagrange interpolation polynomial is the sum of monomial of degree q-2 and a polynomial of degree at most k-1. So there are at least 2(q-1)qk deep holes if k q-3.     

Fuzzy groups and level subgroups

Let ? be an algebraic integer in a quadratic number field whose minimum polynomial is x² + p₁ + p₀. Then all the elements of the ring $\text{|Z}$[?] can be written uniquely in the base ? as Σ_k^m=0^akπ^k, where 0 ? a_k < |p₀|, if and only if p₀ ? 2 and ?1 ? p₁ ? p₀.     

Galois realizability of groups of orders p 5 and p 6

Let p be an odd prime and k an arbitrary field of characteristic not p. We determine the obstructions for the realizability as Galois groups over k of all groups of orders p ⁵ and p ⁶ that have an abelian quotient obtained by factoring out central subgroups of order p or p ². These obstructions are decomposed as products of p-cyclic algebras, provided that k contains certain roots of unity.     

Polynomials generalizing binomial coefficients and their application to the study of Fermat's last theorem

We study properties of the polynomials φ_k(X) which appear in the formal development Π_{k ? 0}ⁿ (a + bX^k)^rk = Σ_{k ≥ 0}φ_k(X) a^{r ? k}b^k, where r_k ∈ $\text{l}$ and r = Σr_k. this permits us to obtain the coefficients of all cyclotomic polynomials. Then we use these properties to expand the cyclotomic numbers G_r(ξ) = Π_{k = 1}^{p ? 1} (a + bξ^k)^kr, where p is a prime, ξ is a primitive pth root of 1, a, b ∈ $\text{l}$ and 1 ≤ r ≤ p ? 3, modulo powers of ξ ? 1 (until (ξ ? 1)^{2(p ? 1) ? r}). This gives more information than the usual logarithmic derivative. Suppose that $\text{p ? ab(a + b)}$. Let $\text{m = ?}\text{b}\text{a}$. We prove that G_r(ξ) ≡ c^p mod p(ξ ? 1)² for some c ∈ $\text{l}$, if and only if Σ_{k = 1}^{p ? 1}k^{p ? 2 ? r}m^k ≡ 0 (mod p). We hope to show in this work that this result is useful in the study of the first case of Fermat's last theorem.     

On the maximum number of permutations with given maximal or minimal distance

Let us denote by R(k, ? λ)[R(k, ? λ)] the maximal number $\text{M}$ such that there exist $\text{M}$ different permutations of the set {1,…, k} such that any two of them have at least λ (at most λ, respectively) common positions. We prove the inequalities R(k, ? λ) ? kR(k ? 1, ? λ ? 1), R(k, ? λ) ? R(k, ? λ ? 1) ? k!, R(k, ? λ) ? kR(k ? 1, ? λ ? 1). We show: R(k, ? k ? 2) = 2, R(k, ? 1) = (k ? 1)!, R(p^m, ? 2) = (p^m ? 2)!, R(p^m + 1, ? 3) = (p^m ? 2)!, $\text{R(k, ? k ? 3) =}\text{k!}\text{2}$, R(k, ? 0) = k, R(p^m, ? 1) = p^m(p^m ? 1), R(p^m + 1, ? 2) = (p^m + 1)p^m(p^m ? 1). The exact value of R(k, ? λ) is determined whenever k ? k₀(k ? λ); we conjecture that R(k, ? λ) = (k ? λ)! for k ? k₀(λ). Bounds for the general case are given and are used to determine that the minimum of |R(k, ? λ) ? R(k, ? λ)| is attained for $\text{λ = (}\text{k}\text{2}\text{) + O(}\text{k}\text{log}\text{k}\text{)}$.     

Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs

In this paper, we classify the reflexible regular orientable embeddings and the self-Petrie dual regular orientable embeddings of complete bipartite graphs. The classification shows that for any natural number n, say (p₁,p₂,…,p_k are distinct odd primes and a_i>0 for each i?1), there are t distinct reflexible regular embeddings of the complete bipartite graph K_n,n up to isomorphism, where t=1 if a=0, t=2^k if a=1, t=2^k+1 if a=2, and t=3·2^k+1 if a?3. And, there are s distinct self-Petrie dual regular embeddings of K_n,n up to isomorphism, where s=1 if a=0, s=2^k if a=1, s=2^k+1 if a=2, and s=2^k+2 if a?3.     

A function with prescribed initial derivatives in different Banach spaces

Let X₀ ? X₁ ? ··· ? X_p be Banach spaces with continuous injection of X_k into X_{k + 1} for 0 ? k ? p ? 1, and with X₀ dense in X_p. We seek a function u: [0, 1] → X₀ such that its kth derivative u^(k), k = 0, 1,…, p, is continuous from [0, 1] into x_k, and satisfies the initial condition u^(k)(0) = a_k?X_k. It is shown that such a function exists if and only if the initial values a₀, a₁, …, a_p satisfy a certain condition reminiscent of interpolation theory. This condition always holds when p = 1; when p ? 2, the spaces X_k (k = 0, 1, …, p) may or may not be such that the desired function exists for any given initial values a_k?X_k.     

Semisymmetric graphs of order 6p 2 and prime valency

In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.     

Small point sets of PG(n, q 3) intersecting each k-subspace in 1 mod q points

The main result of this paper is that point sets of PG(n, q ³), q = p ^h , p ≥ 7 prime, of size less than 3(q ^3(n?k) + 1)/2 intersecting each k-space in 1 modulo q points (these are always small minimal blocking sets with respect to k-spaces) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p ³), p ≥ 7 prime, of size less than 3(p ^3(n?k) + 1)/2 with respect to k-spaces are linear. We also give a classification of small linear blocking sets of PG(n, q ³) which meet every (n ? 2)-space in 1 modulo q points.     

On sets of vectors of a finite vector space in which every subset of basis size is a basis II

This article contains a proof of the MDS conjecture for k ≤?2p ? 2. That is, that if S is a set of vectors of ${{\mathbb F}_q^k}$ in which every subset of S of size k is a basis, where q?=?p ^h , p is prime and q is not and k ≤ 2p ? 2, then |S| ≤ q?+?1. It also contains a short proof of the same fact for k?≤ p, for all q.     

A note on k-plane integral transforms

Let Π be a k-dimensional subspace of Rⁿ, n ? 2, and write x = (x′, x″) with x′ in Π and x″ in the orthogonal complement Π^⊥. The k-plane transform of a measurable function ? in the direction Π at the point x″ is defined by $\text{L?(Π, x″) = ∝Π?(x′, x″) dx′}$. In this article certain a priori inequalities are established which show in particular that if $\text{? ? L}{}^{\mathrm{p}}\text{(R}{}^{\mathrm{n}}\text{)}$, $\text{1 ? p}\text{\$}\text{?}\text{n}\text{k}$, then ? is integrable over almost every translate of almost every k-space. Mapping properties of the k-plane transform between the spaces L^p(Rⁿ), p ? 2, and certain Lebesgue spaces with mixed norm on a vector bundle over the Grassmann manifold of k-spaces in Rⁿ are also obtained.     

Groupes de permutations primitifs d'ordre impair et denombrement de tournois sommet-primitifs

A tournament T (directed graph in which there is exactly one arc between any two vertices) is said to be point-primitive if its automorphism group A(T) acts primitively on the vertices of T. Automorphism groups of point-primitive tournaments are primitive permutation groups of odd order, which are known to be affine groups; and so point-primitive tournaments are of prime-power order. Some properties of primitive permutation groups of odd order are proved and a counting formula for point-primitive tournaments of order p^2k (p prime number, k integer ?0) is derived from them.     

Carleson measures and the generalized Campanato spaces of vector-valued martingales

In this paper, the so-called(p, φ)-Carleson measure is introduced and the relationship between vector-valued martingales in the general Campanato spaces Lp,φ(X) and the(p, φ)-Carleson measures is investigated. Specifically, it is proved that for q ∈ [2, ∞), the measure dμ := ||dfk||~qdP ? dm is a(q, φ)-Carleson measure on ? × N for every f ∈ L_q,φ(X)if and only if X has an equivalent norm which is q-uniformly convex; while for p ∈(1, 2], the measure dμ :=||dfk||~pdP ? dm is a(p, φ)-Carleson measure on ? × N implies that f ∈ L_p,φ(X)if and only if X admits an equivalent norm which is p-uniformly smooth. This result extends an earlier result in the literature from BMO spaces to general Campanato spaces.     

On the number of cycles possible in digraphs with large girth

We consider directed graphs which have no short cycles. In particular, if n is the number of vertices in a graph which has no cycles of length less than n ? k, for some constant k < ?n, then we show that the graph has no more than 3^k cycles. In addition, we show that for k ≤ ½n, there are graphs with exactly 3^k cycles. We thus are able to show that it is possible to bound the number of cycles possible in a graph which has no cycles of length less than f(n) by a polynomial in n if and only if f(n) ≥ n ? rlog(n) for some r.     

On the structure of some group codes

In this paper, we study the following problem: Which characteristics does a codeC possess when the syntactic monoidsyn(C ^*) of the star closureC ^* ofC is a group? For a codeC, if the syntactic monoidsyn(C ^*) is a group, then we callC a group code. This definition of a group code is different from the one in [1] (see [1], 46–47). Schützenberger had characterized the structure of finite group codes and had proved thatC is a finite group code if and only ifC is a full uniform code (see [5], [8]). Fork-prefix andk-suffix codes withk≥2,k-infix,k-outfix,p-infix,s-infix, right semaphore codes and left semaphore codes, etc., we obtain similar results. It is proved that the above mentioned codes are group codes if and only if they are uniform codes.     

On n-Hamiltonian line graphs

With each nonempty graph G one can associate a graph L(G), called the line graph of G, with the property that there exists a one-to-one correspondence between E(G) and V(L(G)) such that two vertices of L(G) are adjacent if and only if the corresponding edges of G are adjacent. For integers m ≥ 2, the mth iterated line graph L^m(G) of G is defined to be L(L^m-1(G)). A graph G of order p ≥ 3 is n-Hamiltonian, 0 ≤ n ≤ p ? 3, if the removal of any k vertices, 0 ≤ k ≤ n, results in a Hamiltonian graph. It is shown that if G is a connected graph with δ(G) ≥ 3, where δ(G) denotes the minimum degree of G, then L²(G) is (δ(G) ? 3)-Hamiltonian. Furthermore, if G is 2-connected and δ(G) ≥ 4, then L²(G) is (2δ(G) ? 4)-Hamiltonian. For a connected graph G which is neither a path, a cycle, nor the graph K(1, 3) and for any positive integer n, the existence of an integer k such that L^m(G) is n-Hamiltonian for every m ≥ k is exhibited. Then, for the special case n = 1, bounds on (and, in some cases, the exact value of) the smallest such integer k are determined for various classes of graphs.     

On Gibbs measures of P-adic Potts model on the cayley tree

We consider a nearest-neighbor p-adic Potts (with q ≥ 2 spin values and coupling constant J ? _p) model on the Cayley tree of order k ≥ 1. It is proved that a phase transition occurs at k = 2, q ? p and p ≥ 3 (resp. q ? 2², p = 2). It is established that for p-adic Potts model at k ≥ 3 a phase transition may occur only at q ? p if p ≥ 3 and q ? 2² if p = 2.     

Hamiltonian cycles in particular k-partite graphs

Let $\text{G}$(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardinality p and where the edges between any pair of stable sets are those of a perfect matching. Maru?i? has conjectured that if G belongs to $\text{G}$(k, p) and is connected then G is hamiltonian. It is proved that the conjecture is true for k ≤ 3 or p ≤ 3; but for k ≥ 4 and p ≥ 4 a non-hamiltonian connected graph in $\text{G}$(k, p) is constructed.     

Maximum graphs with a unique k-factor

For suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of order p which has a unique k-factor. The values of f(p, k) are determined for k = 2, p ? 3, and p ? 2 and the extremal graphs are determined.