Algorithms for zero-dimensional ideals using linear recurrent sequences

Inspired by Faug\`ere and Mou's sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing the annihilator of one or several such sequences.Comment: LNCS, Computer Algebra in Scientific Computing CASC 201

Description of Fischer Clusters Formation in Supercooled Liquids Within Framework of Continual Theory of Defects

Liquid is represented as complicated system of disclinations according to defect description of liquids and glasses. The expressions for the linear disclination field of an arbitrary form and energy of inter-disclination interaction are derived in the framework of gauge theory of defects. It allows us to describe liquid as a disordered system of topological moments and reduce this model to the Edwards--Anderson model with large-range interaction. Within the framework of this approach vitrifying is represented as a "hierarchical" phase transition. The suggested model allows us to explain the process of the Fischer clusters formation and the slow dynamics in supercooled liquids close to the liquid--glass transition point

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces

International audienceWe consider the problem of constructing roadmaps of real algebraic sets. The problem was introduced by Canny to answer connectivity questions and solve motion planning problems. Given $s$ polynomial equations with rational coefficients, of degree $D$ in $n$ variables, Canny's algorithm has a Monte Carlo cost of $s^n\log(s) D^{O(n^2)}$ operations in $\mathbb{Q}$; a deterministic version runs in time $s^n \log(s) D^{O(n^4)}$. The next improvement was due to Basu, Pollack and Roy, with an algorithm of deterministic cost $s^{d+1} D^{O(n^2)}$ for the more general problem of computing roadmaps of semi-algebraic sets ($d \le n$ is the dimension of an associated object). We give a Monte Carlo algorithm of complexity $(nD)^{O(n^{1.5})}$ for the problem of computing a roadmap of a compact hypersurface $V$ of degree $D$ in $n$ variables; we also have to assume that $V$ has a finite number of singular points. Even under these extra assumptions, no previous algorithm featured a cost better than $D^{O(n^2)}$

Impact of COVID-19 on cardiovascular testing in the United States versus the rest of the world

Objectives: This study sought to quantify and compare the decline in volumes of cardiovascular procedures between the United States and non-US institutions during the early phase of the coronavirus disease-2019 (COVID-19) pandemic. Background: The COVID-19 pandemic has disrupted the care of many non-COVID-19 illnesses. Reductions in diagnostic cardiovascular testing around the world have led to concerns over the implications of reduced testing for cardiovascular disease (CVD) morbidity and mortality. Methods: Data were submitted to the INCAPS-COVID (International Atomic Energy Agency Non-Invasive Cardiology Protocols Study of COVID-19), a multinational registry comprising 909 institutions in 108 countries (including 155 facilities in 40 U.S. states), assessing the impact of the COVID-19 pandemic on volumes of diagnostic cardiovascular procedures. Data were obtained for April 2020 and compared with volumes of baseline procedures from March 2019. We compared laboratory characteristics, practices, and procedure volumes between U.S. and non-U.S. facilities and between U.S. geographic regions and identified factors associated with volume reduction in the United States. Results: Reductions in the volumes of procedures in the United States were similar to those in non-U.S. facilities (68% vs. 63%, respectively; p = 0.237), although U.S. facilities reported greater reductions in invasive coronary angiography (69% vs. 53%, respectively; p < 0.001). Significantly more U.S. facilities reported increased use of telehealth and patient screening measures than non-U.S. facilities, such as temperature checks, symptom screenings, and COVID-19 testing. Reductions in volumes of procedures differed between U.S. regions, with larger declines observed in the Northeast (76%) and Midwest (74%) than in the South (62%) and West (44%). Prevalence of COVID-19, staff redeployments, outpatient centers, and urban centers were associated with greater reductions in volume in U.S. facilities in a multivariable analysis. Conclusions: We observed marked reductions in U.S. cardiovascular testing in the early phase of the pandemic and significant variability between U.S. regions. The association between reductions of volumes and COVID-19 prevalence in the United States highlighted the need for proactive efforts to maintain access to cardiovascular testing in areas most affected by outbreaks of COVID-19 infection

Resolvent and Rational Canonical Forms of Matrices

The goal of this paper is to explain how to derive from the resolvent of a matrix the following classical rational canonical forms: the Dunford decomposition, the rational spectral decomposition, the Jacobson and the rational Jordan forms (with corresponding change of basis matrices). We don&apos;t pretend that this approach is more efficient than other algorithms classicaly used to build these forms, but we transform theoritical and non rational methods used in the context of pertubation matrices into effective rational algorithms well adapted to Computer Algebra. 1 Resolvent Let us collect some basic facts about the resolvent of a linear operator acting on a finite-dimensional vector space (the general and classical reference for the first paragraph is [7]). A will be a matrix belonging to the algebra Mn (k) of square matrices of order n with coefficients in the zero characteristic field k. We will note I the identity matrix of Mn (k) and K an algebraic closure of k. Let oe(A) be the s..

Composition Modulo Powers of Polynomials

International audienc