相关论文: Quadrics in arithmetic statistics

A re-calculation of a known family of formulas of PI is carried out, revisiting the old Archimedes' algorithm. This allows to identify a general family equation and three new simple formulas of Pi in terms of the golden ratio PHI in the…

We apply recent constructions of free Baxter algebras to the study of the umbral calculus. We give a characterization of the umbral calculus in terms of Baxter algebra. This characterization leads to a natural generalization of the umbral…

In 1970 A. Baker and W. Schmidt introduced regular systems of numbers and vectors, showing that the set of real algebraic numbers forms a regular system on any fixed interval. This fact was used to prove several important results in the…

In this paper, we propose standard statistical tools as a solution to commonly highlighted problems in the explainability literature. Indeed, leveraging statistical estimators allows for a proper definition of explanations, enabling…

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…

Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…

In the last quarter of a century, algebraic statistics has established itself as an expanding field which uses multilinear algebra, commutative algebra, computational algebra, geometry, and combinatorics to tackle problems in mathematical…

In this paper, we are going to compute the average size of 2-Selmer groups of families of even hyperelliptic curves over function fields. The result will be obtained by a geometric method which is based on a Vinberg representation of the…

We use simple equations in order to compare the basins of attraction on the complex plane, corresponding to a large collection of numerical methods, of several order. Two cases are considered, regarding the total number of the roots, which…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

In this paper, we investigate subnormal subgroups of the multiplicative group of an almost locally simple artinian algebra with involution. In particular, we show that if either the set of traces or the set of norms of such a subgroup with…

For the first time, we introduce "Scaling invariable Benford distance" and "Benford cyclic graph", which can be used to analyze any data set. Using the quantity and the graph, we analyze some date sets with common distributions, such as…

We study the problem of fitting circles (or circular arcs) to data points observed with errors in both variables. A detailed error analysis for all popular circle fitting methods -- geometric fit, Kasa fit, Pratt fit, and Taubin fit -- is…

This paper aims to improve existing results about using averaging method for analysis of dynamic systems on time scales. We obtain a more accurate estimate for proximity between solutions of original and averaged systems regarding…

It is classically known that the circle method produces an asymptotic for the number of representations of a tuple of integers $(n_1,\ldots,n_R)$ by a system of quadratic forms $Q_1,\ldots, Q_R$ in $k$ variables, as long as $k$ is…

A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their domain. In practice, the count is averaged over a class of…

This paper is about how we study statistical methods. As an example, it uses the random regressions model, in which the intercept and slope of cluster-specific regression lines are modeled as a bivariate random effect. Maximizing this…

In some cases, computational benefit can be gained by exploring the hyper parameter space using a deterministic set of grid points instead of a Markov chain. We view this as a numerical integration problem and make three unique…