Related papers: Around the 'Fundamental Theorem of Algebra' (exten…

A conjecture of Kac states that the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field with given dimension vector has positive coefficients and furthermore that its constant term is…

Algebras of relations form an algebraic framework for the study of logical systems, extending the correspondence between Boolean algebras and propositional logic. Tarski's representable cylindric algebras $RCA_{\alpha}$, and Halmos'…

Let $\mathfrak{g}$ be a symmetrizable Kac--Moody algebra. Given a root $\alpha$ and a real root $\beta$ of $\mathfrak{g}$, it is known that the $\beta$-string through $\alpha$, denoted $R_\alpha(\beta)$, is finite. Given an imaginary root…

We review the main topics concerning Fusion Rule Algebras (FRA) of Rational Conformal Field Theories. After an exposition of their general properties, we examine known results on the complete classification for low number of fields ($\leq…

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

Derivations are linear operators which satisfy the Leibniz rule, while integrations are linear operators which satisfy the Rota-Baxter rule. In this paper, we introduce the notion of an FTC-pair, which consists of an algebra and module with…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

We establish axiomatic characterizations of $K$-theory and $KK$-theory for real C*-algebras. In particular, let $F$ be an abelian group-valued functor on separable real C*-algebras. We prove that if $F$ is homotopy invariant, stable, and…

The paper continues the intriguing theme that many key facts of (single-variable) Real Analysis are not only crucially dependent on the completeness of the real numbers, but are actually equivalent to it. The list of these characterizations…

We study various statistical properties of real roots of three different classes of random polynomials which recently attracted a vivid interest in the context of probability theory and quantum chaos. We first focus on gap probabilities on…

We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root…

The Kac polynomial $$f_n(x) = \sum_{i=0}^{n} \xi_i x^i$$ with independent coefficients of variance 1 is one of the most studied models of random polynomials. It is well-known that the empirical measure of the roots converges to the uniform…

We state some generalizations of a theorem due to G. Darboux, which originally states that a polynomial vector field in the complex plane exhibits a rational first integral and has all its orbits algebraic provided that it exhibits…

Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…

We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the…

Over a composition algebra $A$, a polynomial $f(x) \in A[x]$ has a root $\alpha$ if and only $f(x)=g(x)\cdot (x-\alpha)$ for some $g(x) \in A[x]$. We examine whether this is true for general Cayley-Dickson algebras. The conclusion is that…

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…