On the maximum rank of a real binary form

We show that a real binary form f of degree n has n distinct real roots if and only if for any \({(\alpha,\beta)\in\mathbb{R}^2{\setminus}\{0\}}\) all the forms αf _x + βf _y have n ? 1 distinct real roots. This answers to a question of Comon and Ottaviani (On the typical rank of real binary forms, available at arXiv:math/0909.4865, 2009), and allows to complete their argument to show that f has symmetric rank n if and only if it has n distinct real roots.     

Implicit extremes and implicit max–stable laws

Let X ₁, ? , X _n be iid random vectors and f≥0 be a homogeneous non–negative function interpreted as a loss function. Let also k(n)=Argmax _{i=1c? , n} f(X _i ). We are interested in the asymptotic behavior of X _k(n) as n→∞. In other words, what is the distribution of the random vector leading to maximal loss. This question is motivated by a kind of inverse problem where one wants to determine the extremal behavior of X when only explicitly observing f(X). We shall refer to such types of results as implicit extremes. It turns out that, as in the usual case of explicit extremes, all limit implicit extreme value laws are implicit max–stable. We characterize the regularly varying implicit max–stable laws in terms of their spectral and stochastic representations. We also establish the asymptotic behavior of implicit order statistics relative to a given homogeneous loss and conclude with several examples drawing connections to prior work involving regular variation on general cones.     

Double roots of random littlewood polynomials

We consider random polynomials whose coefficients are independent and uniform on {-1, 1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^-2) when n+1 is not divisible by 4 and asymptotic to \(1/\sqrt 3 \) otherwise. This result is a corollary of a more general theorem that we prove concerning random polynomials with independent, identically distributed coefficients having a distribution which is supported on {-1, 0, 1} and whose largest atom is strictly less than \(\frac{{8\sqrt 3 }}{{\pi {n^2}}}\). In this general case, we prove that the probability of having a double root equals the probability that either -1, 0 or 1 are double roots up to an o(n^-2) factor and we find the asymptotics of the latter probability.     

Holomorphic factorization of polynomials

We give necessary and sufficient conditions for a holomorphic factorization of an irreducible polynomial P(s, λ), s ∈ Cⁿ, λ ∈ C, in a domain Ω ? Cⁿ which is connected with the ordering of the real part of the roots of the equation P(s, λ) = 0, s ∈ Ω.     

On rationalizing divisors

Rational pairs generalize the notion of rational singularities to reduced pairs (X, D). In this paper we deal with the problem of determining whether a normal variety X has a rationalizing divisor, i.e., a reduced divisor D such that (X, D) is a rational pair. We give a criterion for cones to have a rationalizing divisor, and relate the existence of such a divisor to the locus of rational singularities of a variety.     

Non-Hermitian matrices of even order and neutral subspaces of half the dimension

Consider the sesquilinearmatrix equation X*DX + AX + X*B + C = 0, where all the matrices are square and have the same order n. With this equation, we associate a block matrix M of double order 2n. The solvability of the above equation turns out to be related to the existence of n-dimensional neutral subspaces for the matrix M. We indicate sufficiently general conditions ensuring the existence of such subspaces.     

Representation and character varieties of the Baumslag-Solitar groups

Representation and character varieties of the Baumslag–Solitar groups BS(p, q) are analyzed. Irreducible components of these varieties are found, and their dimension is calculated. It is proved that all irreducible components of the representation variety R_n(BS(p, q)) are rational varieties of dimension n², and each irreducible component of the character variety X_n(BS(p, q)) is a rational variety of dimension k ≤ n. The smoothness of irreducible components of the variety R_n^s (BS(p, q)) of irreducible representations is established, and it is proved that all irreducible components of the variety R_n^s (BS(p, q)) are isomorphic to A¹ {0}.     

Solving Equations of Free Vibration for a Cylindrical Shell Rotating on Rollers by the Fourier Method

The small free vibrations of an infinite circular cylindrical shell rotating about its axis at a constant angular velocity are considered. The shell is supported on n absolutely rigid cylindrical rollers equispaced on its circle. The roller-supported shell is a model of an ore benefication centrifugal concentrator with a floating bed. The set of linear differential equations of vibrations is sought in the form of a truncated Fourier series containing N terms along the circumferential coordinate. A system of 2N–n linear homogeneous algebraic equations with 2N–n unknowns is derived for the approximate estimation of vibration frequencies and mode shapes. The frequencies ω _k , k = 1, 2, …, 2N–n, are positive roots of the (2N–n)th-order algebraic equation D(ω²) = 0, where D is the determinant of this set. It is shown that the system of 2N–n equations is equivalent to several independent systems with a smaller number of unknowns. As a consequence, the (2N–n)th-order determinant D can be written as a product of lower-order determinants. In particular, the frequencies at N = n are the roots of algebraic equations of an order is lower than 2 and can be found in an explicit form. Some frequency estimation algorithms have been developed for the case of N > n. When N increases, the number of found frequencies also grows, and the frequencies determined at N = n are refined. However, in most cases, the vibration frequencies can not be found for N > n in an explicit form.     

Some irreducibility and indecomposability results for truncated binomial polynomials of small degree

In this paper, we show that the truncated binomial polynomials defined by \(P_{n,k}(x)={\sum }_{j=0}^{k} {n \choose j} x^{j}\) are irreducible for each k≤6 and every n≥k+2. Under the same assumption n≥k+2, we also show that the polynomial P _n,k cannot be expressed as a composition P _n,k (x) = g(h(x)) with \(g \in \mathbb {Q}[x]\) of degree at least 2 and a quadratic polynomial \(h \in \mathbb {Q}[x]\). Finally, we show that for k≥2 and m,n≥k+1 the roots of the polynomial P _m,k cannot be obtained from the roots of P _n,k , where m≠n, by a linear map.     

A note on the cubical dimension of new classes of binary trees

The cubical dimension of a graph G is the smallest dimension of a hypercube into which G is embeddable as a subgraph. The conjecture of Havel (1984) claims that the cubical dimension of every balanced binary tree with 2 ⁿ vertices, n ? 1, is n. The 2-rooted complete binary tree of depth n is obtained from two copies of the complete binary tree of depth n by adding an edge linking their respective roots. In this paper, we determine the cubical dimension of trees obtained by subdividing twice a 2-rooted complete binary tree and prove that every such balanced tree satisfies the conjecture of Havel.     

On the number of nonstationary bounded trajectories of a class of autonomous systems on the plane

We study the number of nonstationary bounded trajectories of autonomous systems of the form z′ = \(\overline {P_n (z)} \), z = x + iy ∈ C, where P _n (z) is a polynomial of degree n with complex coefficients that has k distinct roots, n, k > 1. We prove that the number N of nonstationary bounded trajectories of this system satisfies the following assertions (Theorem 1): (a) N = n + k ? N ₊, N ₊ = N _?, n + 1 ≤ N ₊ ≤ n + k, where N ₊ and N _? are the numbers of system trajectories unbounded as t → +∞ and t → ?∞, respectively; (b) if some r distinct roots \(c_{j_1 } \), ..., \(c_{j_r } \) of the polynomial P _n satisfy the relations V _n+1 (\(c_{j_1 } \)) = ··· = V _n+1 (\(c_{j_r } \)), where V _n+1 is the imaginary part of the indeterminate integral of P _n , then N ≥ \(m_{j_1 } \) + ··· + \(m_{j_r } \) + r ? n ? 1; (c) if k = 2, then the conditions N = 1 and V _n+1 (c ₁) = V _n+1 (c ₂) are equivalent. For n = k = 3, we derive a formula for the number of nonstationary bounded trajectories (Theorem 2).     

Representations of Regular Trees and Invariants of AR-Components for Generalized Kronecker Quivers

We investigate the generalized Kronecker algebra ?? _r = kΓ _r with r ≥ 3 arrows. Given a regular component ?? of the Auslander-Reiten quiver of ?? _r , we show that the quasi-rank rk(??) ∈ ?_≤1 can be described almost exactly as the distance ??(??) ∈ ?₀ between two non-intersecting cones in ??, given by modules with the equal images and the equal kernels property; more precisley, we show that the two numbers are linked by the inequality

$-\mathcal{W}(\mathcal{C}) \leq \text{rk}(\mathcal{C}) \leq - \mathcal{W}(\mathcal{C}) + 3.$

Utilizing covering theory, we construct for each n ∈ ?₀ a bijection φ _n between the field k and {??∣?? regular component, ??(??) = n}. As a consequence, we get new results about the number of regular components of a fixed quasi-rank.

     

Involutions in Weyl group of type <Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>

Let W be the Weyl group of type F ₄: We explicitly describe a finite set of basic braid I _*-transformations and show that any two reduced I _*-expressions for a given involution in W can be transformed into each other through a series of basic braid I _*-transformations. Our main result extends the earlier work on the Weyl groups of classical types (i.e., A _n , B _n , and D _n ).     

Tauberian Theorems for the ($$\bar N$$ , pm,n) and ( M, λm,n) Methods for Double Series over Ultrametric Fields

In this paper, K denotes a complete, non-trivially valued, non-archimedean (or ultrametric) field. Entries of double sequences, double series and 4-dimensional infinite matrices are in K.We prove Tauberian theorems for the Weighted Mean and (M,λ _m,n ) methods for double series.     

Normal connections induced by a framed hypersurface in the conformal space

We find two normal connections induced by the normal framing of a hypersurface V _{n ? 1} in the conformal space C _n , and establish relationship between these connections and a Weyl connection which is also induced by the normal framing of V _{n ? 1}. We study two normal connections induced by a complete framing of a hypersurface V _{n ? 1} in C _n . We establish relationship between geometries of a framed hypersurface V _{n ? 1} of the conformal space C _n and a quadratic hyperband of the projective space P _{n + 1} associated with V _{n ? 1}.     

Certain pairs of irreducible characters of the groups <Emphasis Type="Italic">S</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The investigation of the pairs of irreducible characters of the symmetric group S _n that have the same set of roots in one of the sets A _n and S _n ? A _n is continued. All such pairs of irreducible characters of the group S _n are found in the case when the least of the main diagonal’s lengths of the Young diagrams corresponding to these characters does not exceed 2. Some arguments are obtained for the conjecture that alternating groups A _n have no pairs of semiproportional irreducible characters.     

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments

Given a tournament T?=?(X, A), we consider two tournament solutions applied to T: Slater’s solution and Copeland’s solution. Slater’s solution consists in determining the linear orders obtained by reversing a minimum number of directed edges of T in order to make T transitive. Copeland’s solution applied to T ranks the vertices of T according to their decreasing out-degrees. The aim of this paper is to compare the results provided by these two methods: to which extent can they lead to different orders? We consider three cases: T is any tournament, T is strongly connected, T has only one Slater order. For each one of these three cases, we specify the maximum of the symmetric difference distance between Slater orders and Copeland orders. More precisely, thanks to a result dealing with arc-disjoint circuits in circular tournaments, we show that this maximum is equal to n(n???1)/2 if T is any tournament on an odd number n of vertices, to (n ²???3n?+?2)/2 if T is any tournament on an even number n of vertices, to n(n???1)/2 if T is strongly connected with an odd number n of vertices, to (n ²???3n???2)/2 if T is strongly connected with an even number n of vertices greater than or equal to 8, to (n ²???5n?+?6)/2 if T has an odd number n of vertices and only one Slater order, to (n ²???5n?+?8)/2 if T has an even number n of vertices and only one Slater order.     

Computing the determinantal representations of hyperbolic forms

The numerical range of an n × n matrix is determined by an n degree hyperbolic ternary form. Helton-Vinnikov confirmed conversely that an n degree hyperbolic ternary form admits a symmetric determinantal representation. We determine the types of Riemann theta functions appearing in the Helton-Vinnikov formula for the real symmetric determinantal representation of hyperbolic forms for the genus g = 1. We reformulate the Fiedler-Helton-Vinnikov formulae for the genus g = 0, 1, and present an elementary computation of the reformulation. Several examples are provided for computing the real symmetric matrices using the reformulation.     

Remarks on Ramanujam-Kawamata-Viehweg Vanishing Theorem

In this article we prove a general result on a nef vector bundle E on a projective manifold X of dimension n depending on the vector space H^n,n(X,E): It is also shown that H^n,n(X,E) = 0 for an indecomposable nef rank 2 vector bundles E on some specific type of n dimensional projective manifold X. The same vanishing shown to hold for indecomposable nef and big rank 2 vector bundles on any variety with trivial canonical bundle.     

Some relations among multiplicative and <Emphasis Type="Italic">q</Emphasis>-additive functions

We give all solutions of the equation f(n) = g(n) + h(n) for every n ∈ ?, where f is a completely multiplicative, g is a 2-additive, and h is a 3-additive function. We also determine all completely multiplicative functions f and all q-additive functions g for which f(n) = g ²(n) for every n ∈ ?.