Related papers: Atypical points at infinity and algorithmic detect…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

We define a natural topology on the collection of (equivalence classes up to scaling of) locally finite measures on a homogeneous space and prove that in this topology, pushforwards of certain infinite volume orbits equidistribute in the…

We examine functions representing the cumulative probability of a binomial random variable exceeding a threshold, expressed in terms of the success probability per trial. These functions are known to exhibit a unique inflection point. We…

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…

We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…

In this paper, we relate the set of asymptotic critical values of a polynomial function $f$ with the set of discontinuity of two functions, the multivalued function which associate to each value $t$ the set of tangent directions at infinity…

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

For every affine variety over a global function field, we show that the set of its points with coordinates in an arbitrary rank-one multiplicative subgroup of this function field is topologically dense in the set of its points with…

We study the computation of local approximations of invariant manifolds of parabolic fixed points and parabolic periodic orbits of periodic vector fields. If the dimension of these manifolds is two or greater, in general, it is not possible…

We introduce a topology, which we call the regional topology, on the space of all real functions on a given locally compact metric space. Next we obtain a new versions of Schauder's fixed point theorem and Ascoli's theorem. We use these…

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…