Designing an algorithm with a singly exponential complexity for computing semialgebraic triangulations of a given semialgebraic set has been a holy grail in algorithmic semialgebraic geometry. More precisely, given a description of a semialgebraic set $S \subset \mathbb {R}^k$ by a first-order quantifier-free formula in the language of the reals, the goal is to output a simplicial complex $\Delta $ , whose geometric realization, $|\Delta |$ , is semialgebraically homeomorphic to S. In this paper, we consider a weaker version of this question. We prove that for any $\ell \geq 0$ , there exists an algorithm which takes as input a description of a semialgebraic subset $S \subset \mathbb {R}^k$ given by a quantifier-free first-order formula $\phi $ in the language of the reals and produces as output a simplicial complex $\Delta $ , whose geometric realization, $|\Delta |$ is $\ell $ -equivalent to S. The complexity of our algorithm is bounded by $(sd)^{k^{O(\ell )}}$ , where s is the number of polynomials appearing in the formula $\phi $ , and d a bound on their degrees. For fixed $\ell $ , this bound is singly exponential in k. In particular, since $\ell $ -equivalence implies that the homotopy groups up to dimension $\ell $ of $|\Delta |$ are isomorphic to those of S, we obtain a reduction (having singly exponential complexity) of the problem of computing the first $\ell $ homotopy groups of S to the combinatorial problem of computing the first $\ell $ homotopy groups of a finite simplicial complex of size bounded by $(sd)^{k^{O(\ell )}}$ .

The problem of inverting the total divergence operator is central to finding components of a given conservation law. This might not be taxing for a low-order conservation law of a scalar partial differential equation, but integrable systems have conservation laws of arbitrarily high order that must be found with the aid of computer algebra. Even low-order conservation laws of complex systems can be hard to find and invert. This paper describes a new, efficient approach to the inversion problem. Two main tools are developed: partial Euler operators and partial scalings. These lead to a line integral formula for the inversion of a total derivative and a procedure for inverting a given total divergence concisely.

In this work, we prove a version of the Sylvester–Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma ^{[3]}\Pi \Sigma \Pi ^{[2]}$ circuits. Specifically, we prove that, if a finite set of irreducible quadratic polynomials ${\mathcal {Q}}$ satisfies that for every two polynomials $Q_1,Q_2\in {\mathcal {Q}}$ there is a subset ${\mathcal {K}}\subset {\mathcal {Q}}$ such that $Q_1,Q_2 \notin {\mathcal {K}}$ and whenever $Q_1$ and $Q_2$ vanish, then $\prod _{i\in {\mathcal {K}}} Q_i$ vanishes, then the linear span of the polynomials in ${\mathcal {Q}}$ has dimension $O(1)$ . This extends the earlier result [21] that holds for the case $|{\mathcal {K}}| = 1$ .

We show that the cohomology intersection number of a twisted Gauss–Manin connection with regularization condition is a rational function. As an application, we obtain a new quadratic relation associated to period integrals of a certain family of K3 surfaces.

We study the number of random permutations needed to invariably generate the symmetric group Sn when the distribution of cycle counts has the strong α-logarithmic property. The canonical example is the Ewens sampling formula, for which the special case α = 1 corresponds to uniformly random permutations.

For strong α-logarithmic measures and almost every α, we show that precisely ⌈(1−αlog2)−1⌉ permutations are needed to invariably generate Sn with asymptotically positive probability. A corollary is that for many other probability measures on Sn no fixed number of permutations will invariably generate Sn with positive probability. Along the way we generalize classic theorems of Erdős, Tehran, Pyber, Łuczak and Bovey to permutations obtained from the Ewens sampling formula.

Jean-Louis Loday introduced a class of symmetric operads generated by one bilinear operation subject to one relation making each left-normed product of three elements equal to a linear combination of right-normed products: $({{a}_{1}}{{a}_{2}}){{a}_{3}}\,=\,\sum{{{_{\sigma }}_{\in {{s}_{3}}}}\,}{{x}_{\sigma }}\,{{a}_{\sigma \,(1)}}({{a}_{\sigma (2)\,}}{{a}_{\sigma (3)}})$. Such an operad is called a parametrized one-relation operad. For a particular choice of parameters $\{{{x}_{\sigma }}\}$, this operad is said to be regular if each of its components is the regular representation of the symmetric group; equivalently, the corresponding free algebra on a vector space $V$ is, as a graded vector space, isomorphic to the tensor algebra of $V$. We classify, over an algebraically closed field of characteristic zero, all regular parametrized one-relation operads. In fact, we prove that each such operad is isomorphic to one of the following five operads: the left-nilpotent operad defined by the relation $(({{a}_{1}}{{a}_{2}}){{a}_{3}})\,=\,0$, the associative operad, the Leibniz operad, the dual Leibniz (Zinbiel) operad, and the Poisson operad. Our computational methods combine linear algebra over polynomial rings, representation theory of the symmetric group, and Gröbner bases for determinantal ideals and their radicals.

This work generalises the short resolution given by Pisón Casares [‘The short resolution of a lattice ideal’, Proc. Amer. Math. Soc.131(4) (2003), 1081–1091] to any affine semigroup. We give a characterisation of Apéry sets which provides a simple way to compute Apéry sets of affine semigroups and Frobenius numbers of numerical semigroups. We also exhibit a new characterisation of the Cohen–Macaulay property for simplicial affine semigroups.

We introduce PyCFTBoot, a wrapper designed to reduce the barrier to entry in conformal bootstrap calculations that require semidefinite programming. Symengine and SDPB are used for the most intensive symbolic and numerical steps respectively. After reviewing the built-in algorithms for conformal blocks, we explain how to use the code through a number of examples that verify past results. As an application, we show that the multi-correlator bootstrap still appears to single out the Wilson-Fisher fixed points as special theories in dimensions between 3 and 4 despite the recent proof that they violate unitarity.

In this paper, the idea of a combination of variable separation approach and the extended homoclinic test approach is proposed to seek non-travelling wave solutions of Calogero equation. The equation is reduced to some (1+1)-dimensional nonlinear equations by applying the variable separation approach and solves reduced equations with the extended homoclinic test technique. Based on this idea and with the aid of symbolic computation, some new explicit solutions can be obtained.

We study the radius of absolute monotonicity $R$ of rational functions with numerator and denominator of degree $s$ that approximate the exponential function to order $p$. Such functions arise in the application of implicit $s$-stage, order $p$ Runge–Kutta methods for initial value problems, and the radius of absolute monotonicity governs the numerical preservation of properties like positivity and maximum-norm contractivity. We construct a function with $p=2$ and $R>2s$, disproving a conjecture of van de Griend and Kraaijevanger. We determine the maximum attainable radius for functions in several one-parameter families of rational functions. Moreover, we prove earlier conjectured optimal radii in some families with two or three parameters via uniqueness arguments for systems of polynomial inequalities. Our results also prove the optimality of some strong stability preserving implicit and singly diagonally implicit Runge–Kutta methods. Whereas previous results in this area were primarily numerical, we give all constants as exact algebraic numbers.

Let $S$ be a polynomial ring over a field $K$ and let $I$ be a monomial ideal of $S$. We say that $I$ is MHC (that is, $I$ satisfies the maximal height condition for the associated primes of $I$) if there exists a prime ideal $\mathfrak{p}\in {\mathrm{Ass} }_{S} \hspace{0.167em} S/ I$ for which $\mathrm{ht} (\mathfrak{p})$ equals the number of indeterminates that appear in the minimal set of monomials generating $I$. Let $I= { \mathop{\bigcap }\nolimits}_{i= 1}^{k} {Q}_{i} $ be the irreducible decomposition of $I$ and let $m(I)= \max \{ \vert Q_{i}\vert - \mathrm{ht} ({Q}_{i} ): 1\leq i\leq k\} $, where $\vert {Q}_{i} \vert $ denotes the total degree of ${Q}_{i} $. Then it can be seen that when $I$ is primary, $\mathrm{reg} (S/ I)= m(I)$. In this paper we improve this result and show that whenever $I$ is MHC, then $\mathrm{reg} (S/ I)= m(I)$ provided $\vert {\mathrm{Ass} }_{S} \hspace{0.167em} S/ I\vert \leq 2$. We also prove that $m({I}^{n} )\leq n\max \{ \vert Q_{i}\vert : 1\leq i\leq ~k\} - \mathrm{ht} (I)$, for all $n\geq 1$. In addition we show that if $I$ is MHC and $w$ is an indeterminate which is not in the monomials generating $I$, then $\mathrm{reg} (S/ \mathop{(I+ {w}^{d} S)}\nolimits ^{n} )\leq \mathrm{reg} (S/ I)+ nd- 1$ for all $n\geq 1$ and $d$ large enough. Finally, we implement an algorithm for the computation of $m(I)$.

In 1992, Göran Björck and Ralf Fröberg completely characterized the solution set of cyclic-8. In 2001, Jean-Charles Faugère determined the solution set of cyclic-9, by computer algebra methods and Gröbner basis computation. In this paper, a new theory in matrix analysis of rank-deficient matrices together with algorithms in numerical algebraic geometry enables us to present a symbolic-numerical algorithm to derive exactly the defining polynomials of all prime ideals of positive dimension in primary decomposition of cyclic-12. Empirical evidence together with rigorous proof establishes the fact that the positive-dimensional solution variety of cyclic-12 just consists of 72 quadrics of dimension one.

Cubical sets and their homology have been used in dynamical systems as well as in digital imaging. We take a fresh look at this topic, following Zariski ideas from algebraic geometry. The cubical topology is defined to be a topology in ${{\mathbb{R}}^{d}}$ in which a set is closed if and only if it is cubical. This concept is a convenient frame for describing a variety of important features of cubical sets. Separation axioms which, in general, are not satisfied here, characterize exactly those pairs of points which we want to distinguish. The noetherian property guarantees the correctness of the algorithms. Moreover, maps between cubical sets which are continuous and closed with respect to the cubical topology are precisely those for whom the homology map can be defined and computed without grid subdivisions. A combinatorial version of the Vietoris–Begle theorem is derived. This theorem plays the central role in an algorithm computing homology of maps which are continuous with respect to the Euclidean topology.