On spectra of neither Pisot nor Salem algebraic integers

We investigate the class of  ± 1 polynomials evaluated at a real number q> 1 defined as: $$A(q)=\{\epsilon_0+\epsilon_1q+\cdots+\epsilon_k q^k : \epsilon_i\in\{-1,1\}\}$$ and usually called spectrum. Λ(q) is defined by analogy where the coefficients are extended to ± 1,0. In this paper an algorithm for finding the spectrum of a real algebraic integer q without a conjugate of modulus 1 is given. The algorithm can check and terminate if A(q) or Λ(q) is not discrete. Using this criterion a part of a conjecture of Borwein and Hare is proved: if 1 < q < 2 and A(q) is discrete, then all real conjugates of q are of modulus less than q. For an infinite sequence r _2m Zaimi has proved that A(r _2m ) is discrete, and here it is proved that Λ(r _2m ) is not discrete. For given ${q\in (1,2)}$ , an algorithm counting a sequence of  ± 1 polynomials P _n (x) such that, solutions α _n  > q of equations ${P_n(x)=\frac{1}{x-1}}$ satisfy α _n → q, is presented.     

On symmetrical <Emphasis Type="Italic">q</Emphasis>-extensions of the 2-dimensional grid

Properties of symmetrical q-extensions of grids are investigated. A criterion is obtained for a set of symmetrical q-extensions of the 2-dimensional grid Λ² to be finite. This criterion is used to prove, in particular, that the set of all Aut ₀(Λ²)-symmetrical q-extensions of the grid Λ2 is finite for any prime q. The list of all Aut ₀(Λ²)-symmetrical 3-extensions of the grid Λ² is obtained.     

Functional definitions for q-analogues of Eulerian functions and applications

We explore a number of functional properties of the q-gamma function and a class of its quotients; including the q-beta function. We obtain formulas for all higher logarithmic derivatives of these quotients and give precise conditions on their sign. We prove how these and other functional properties, such as the multiplication formula or asymptotic expansion, together with the fundamental functional equation of the q-gamma function uniquely define those functions. We also study reciprocal “relatives” of the fundamental q-gamma functional equation, and prove uniqueness of solution results for them. In addition, we also use a reflection formula of Askey to derive expressions relating the classical sine function and the number π to the q-gamma function. Throughout we highlight the similarities and differences between the cases 0 < q < 1 and q > 1.     

An isoperimetric inequality related to a Bernoulli problem

Given a bounded domain Ω we look at the minimal parameter Λ(Ω) for which a Bernoulli free boundary value problem for the p-Laplacian has a solution minimising an energy functional. We show that amongst all domains of equal volume Λ(Ω) is minimal for the ball. Moreover, we show that the inequality is sharp with essentially only the ball minimising Λ(Ω). This resolves a problem related to a question asked in Flucher et al. (Reine Angew Math 486:165–204, 1997).     

Construction and regularity of transition functions on polish spaces under measurability conditions

This paper concerns the construction and regularity of a transition (probability) function of a non-homogeneous continuous-time Markov process with given transition rates and a general state space. Motivating from a lot of restriction in applications of a transition function with continuous (in t≥0) and conservative transition rates q(t, x, Λ), we consider the case that q(t,x,Λ) are only required to satisfy a mild measurability (in t≥0) condition, which is a generalization of the continuity condition. Under the measurability condition we construct a transition function with the given transition rates, provide a necessary and sufficient condition for it to be regular, and further obtain some interesting additional results.     

Restricted coloring problems on Graphs with few P 4’s

In this paper, we obtain linear time algorithms to determine the acyclic chromatic number, the star chromatic number, the non repetitive chromatic number and the clique chromatic number of P ₄-tidy graphs and (q, q ? 4)-graphs, for every fixed q, which are the graphs such that every set with at most q vertices induces at most q ? 4 distinct P ₄’s. These classes include cographs and P ₄-sparse graphs. We also obtain a linear time algorithm to compute the harmonious chromatic number of connected P ₄-tidy graphs and connected (q, q ? 4)-graphs. All these coloring problems are known to be NP-hard for general graphs. These algorithms are fixed parameter tractable on the parameter q(G), which is the minimum q such that G is a (q, q ? 4)-graph. We also prove that every connected (q, q ? 4)-graph with at least q vertices is 2-clique-colorable and that every acyclic coloring of a cograph is also nonrepetitive, generalizing the main result of Lyons (2011).     

Error bounds for asymptotic expansions of Wilks’ lambda distribution

Let Λ=|S_e|/|S_e+S_h|, where S_h and S_e are independently distributed as Wishart distributions W_p(q,Σ) and W_p(n,Σ), respectively. Then Λ has Wilks’ lambda distribution Λ_p,q,n which appears as the distributions of various multivariate likelihood ratio tests. This paper is concerned with theoretical accuracy for asymptotic expansions of the distribution of T=-nlogΛ. We derive error bounds for the approximations. It is necessary to underline that our error bounds are given in explicit and computable forms.     

On the second weight of generalized Reed-Muller codes

Not much is known about the weight distribution of the generalized Reed-Muller code RM _q (s,m) when q > 2, s > 2 and m ≥ 2. Even the second weight is only known for values of s being smaller than or equal to q/2. In this paper we establish the second weight for values of s being smaller than q. For s greater than (m – 1)(q – 1) we then find the first s + 1 – (m – 1)(q–1) weights. For the case m = 2 the second weight is now known for all values of s. The results are derived mainly by using Gröbner basis theoretical methods.     

On sets of type (q + 1, n)2 in finite three-dimensional projective spaces

It is proved that a k–set of type (q + 1, n)₂ in PG(3, q) either is a plane or it has size k ≥ (q + 1)² and a characterization of some sets of size (q + 1)² is given.     

Infinitely many Gerretsen-Blundon style quadratic inequalities, all strongest in Blundon’s sense

Blundon has proved that if R, r and s are respectively the circumradius, the inradius and the semiperimeter of a triangle, then the strongest possible inequalities of the form q(R, r) ≤ s ² ≤ Q(R, r) that hold for all triangles becoming equalities for the equilaterals where q, Q real quadratic forms, occur for the Gerretsen forms q _B (R, r) = 16Rr ? 5r ² and Q _B (R, r) = 4R ² + 4Rr + 3r ²; strongest in the sense that if Q is a quadratic form and s ² ≤ Q(R, r) ≤ Q _B (R, r) for all triangles then Q(R, r) = Q _B (R, r), and similarly for q _B (R, r). In this paper we prove that Q _B (resp. q _B ) is just one of infinitely many forms that appear as minimal (resp. maximal) elements in the partial order induced by the comparability relation in a certain set of forms, and we conclude that all these minimal forms are strongest in Blundon’s sense. We actually find all possible such strongest forms. Moreover we find all possible quadratic forms q, Q for which q(R, r) ≤ s ² ≤ Q(R, r) for all triangles and which hold as equalities for the equilaterals.     

Fano subplanes in finite Figueroa planes

It has been conjectured that all non-desarguesian projective planes contain a Fano subplane. The Figueroa planes are a family of non-translation planes that are defined for both infinite orders and finite order q ³ for q > 2 a prime power. We will show that there is an embedded Fano subplane in the Figueroa plane of order q ³ for q any prime power.     

The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic

We prove that (q ², 2)-arcs exist in the projective Hjelmslev plane PHG(2, R) over a chain ring R of length 2, order |R| = q ² and prime characteristic. For odd prime characteristic, our construction solves the maximal arc problem. For characteristic 2, an extension of the above construction yields the lower bound q ² + 2 on the maximum size of a 2-arc in PHG(2, R). Translating the arcs into codes, we get linear [q ³, 6, q ³ ?q ² ?q] codes over ${\mathbb {F}_q}$ for every prime power q > 1 and linear [q ³ + q, 6,q ³ ?q ² ?1] codes over ${\mathbb {F}_q}$ for the special case q = 2 ^r . Furthermore, we construct 2-arcs of size (q + 1)²/4 in the planes PHG(2, R) over Galois rings R of length 2 and odd characteristic p ².     

Constructing quasi-cyclic codes from linear algebra theory

Let F _q be a finite field of cardinality q, l and m be positive integers and M _l (F _q ) the F _q -algebra of all l × l matrices over F _q . We investigate the relationship between monic factors of X ^m ? 1 in the polynomial ring M _l (F _q )[X] and quasi-cyclic (QC) codes of length lm and index l over F _q . Then we consider the idea of constructing QC codes from monic factors of X ^m ? 1 in polynomial rings over F _q -subalgebras of M _l (F _q ). This idea includes ideas of constructing QC codes of length lm and index l over F _q from cyclic codes of length m over a finite field F _q l, the finite chain ring F _q  + uF _q  + · · · + u ^{l ? 1} F _q (u ^l  = 0) and other type of finite chain rings.     

Infinite family of large complete arcs in PG(2, q n ), with q odd and n > 1 odd

For q odd and n > 1 odd, a new infinite family of large complete arcs K′ in PG(2, q ⁿ ) is constructed from complete arcs K in PG(2, q) which have the following property with respect to an irreducible conic ${\mathcal{C}}$ in PG(2, q): all the points of K not in ${\mathcal{C}}$ are all internal or all external points to ${\mathcal{C}}$ according as q ≡ 1 (mod 4) or q ≡ 3 (mod 4).