相关论文: A computational criterion for the Kac conjecture

We prove that the $abc$-Conjecture implies upper bounds on Zsigmondy sets that are uniform over families of unicritical polynomials over number fields. As an application, we use the $abc$-Conjecture to prove that there exist uniform bounds…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

We introduce a new class of infinite-dimensional Lie algebras, which we refer to as continuum Kac-Moody algebras. Their construction is closely related to that of usual Kac-Moody algebras, but they feature a continuum root system with no…

In this paper we present a theorem concerning an equivalent statement of the Jacobian Conjecture in terms of Picard-Vessiot extensions. Our theorem completes the earlier work of T. Crespo and Z. Hajto which suggested an effective criterion…

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

We prove that the Cayley-Menger determinant of an $n$-dimensional simplex is an absolutely irreducible polynomial for $n\geq3.$ We also study the irreducibility of polynomials associated to related geometric constructions.

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Continuum Kac-Moody algebras have been recently introduced by the authors and O. Schiffmann. These are Lie algebras governed by a continuum root system, which can be realized as uncountable colimits of Borcherds-Kac-Moody algebras. In this…

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Some mathematical questions relating to Coset Conformal Field Theories (CFT) are considered in the framework of Algebraic Quantum Field Theory as developed previously by us. We consider the issue of fixed point resolution in the diagonal…

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

In this thesis, we study counts of quiver representations over finite rings of truncated power series. We prove a plethystic formula relating counts of quiver representations over these rings and counts of jets on fibres of quiver moment…

There studed correspondence between symplectic leaves, irreducible representations and prime ideals, which is invariant with respect to quantum adjoint action. The Conjecture of De Concini-Kac-Procesi on dimensions of irreducible…

We discuss the known results and methods for determining root multiplicities for hyperbolic Kac--Moody algebras.

We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…

We conjecture a formula for the rational $q,t$-Catalan polynomial $\mathcal{C}_{r/s}$ that is symmetric in $q$ and $t$ by definition. The conjecture posits that $\mathcal{C}_{r/s}$ can be written in terms of symmetric monomial strings…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…