Related papers: Monogenic period equations are cyclotomic polynomi…

We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…

A method of finding relative periodic orbits for differential equations with continuous symmetries is described and its utility demonstrated by computing relative periodic solutions for the one-dimensional complex Ginzburg-Landau equation…

We consider some discrete $q$-analogues of the classical continuous orthogonal polynomial ensembles. Building on results due to Morozov, Popolitov and Shakirov, we find representations for the moments of the discrete $q$-Hermite and…

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…

Cyclic polytopes are characterized as simplicial polytopes satisfying Gale's evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which…

We study the Dynkin diagram associated to the monodromy of direct sums of polynomials. The monodromy problem asks under which conditions on a polynomial, the monodromy of a vanishing cycle generates the whole homology of a regular fiber. We…

In this paper we give an explicit representation of the solutions of a characteristic Cauchy problem for a class of PDEs with singular coefficients. We give the explicit solutions in terms of the Gauss hypergeometric functions, which enable…

A simple non-autonomous scalar differential equation with delay, exponential decay, nonlinear negative feedback and a periodic multiplicative coefficient is considered. It is shown that stable slowly oscillating periodic solutions with the…

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…

For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomial-time algorithm that, for a 1-connected topological space X…

We introduce a family of symmetric convex bodies called generalized ellipsoids of degree $d$ (GE-$d$s), with ellipsoids corresponding to the case of $d=0$. Generalized ellipsoids (GEs) retain many geometric, algebraic, and algorithmic…

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

We present three new, practical algorithms for polynomials in $\mathbb{Z}[x]$: one to test if a polynomial is cyclotomic, one to determine which cyclotomic polynomials are factors, and one to determine whether the given polynomial is…

We define the period as a multiplicative characteristic of stably symmetric monoidal $\infty$-categories, develop its basic properties, and study many examples, with a focus on `ordinary' equivariant and motivic homotopy theory. We apply…

We determine precisely the largest v1-periodic homotopy groups of SU(2^e) and SU(2^e + 1). This gives new results about the largest actual homotopy groups of these spaces. Our proof relies on results about 2-divisibility of restricted sums…

We call a standard graded commutative $\Bbbk$-algebra cyclotomic if its $h$-polynomial has all its roots on the unit circle in the complex plane. Complete intersections provide typical examples of cyclotomic algebras, since the…

We introduce new symmetric and periodic algebras of period 4, which are tame of non-polynomial growth

We study a general class of singular degenerate parabolic stochastic partial differential equations (SPDEs) which include, in particular, the stochastic porous medium equations and the stochastic fast diffusion equation. We propose a fully…

For a pair of conjugate trigonometrical polynomials $C (t) = \sum_ { j = 1 } ^N { { a_j}\cos jt }, S(t) = \sum_ { j = 1 } ^N { { a_j}\sin jt }$ with real coefficients and normalization ${a_1} = 1 $ we solve the extremal problem \[ \sup_…

Let $p>3$ be a prime. Gauss first introduced the polynomial $S_p(x)=\prod_{c}(x-\zeta_p^c),$ where $0<c<p$ and $c$ varies over all quadratic residues modulo $p$ and $\zeta_p=e^{2\pi i/p}$. Later Dirichlet investigated this polynomial and…