相关论文: Approximate Squaring

We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…

For all $k \geq 1$, we show that deciding whether a graph is $k$-planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show that the gap version of this decision problem is…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same…

We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2x2 matrices whose entries sum to d, and we construct an algorithm to…

A rational function of degree at least two with coefficients in an algebraically closed field is post-critically finite (PCF) if all of its critical points have finite forward orbit under iteration. We show that the collection of PCF…

In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…

On the space of rhythms of arbitrary length with a fixed number of onsets, a self map $F$ is constructed. It is shown that for any rhythm $\mathbf{r}$ of the space there exists a nonnegative integer $k$ such that $F^k(\mathbf{r})$ falls…

Building upon previous works of Andr{\'e} and Chudnovsky, we prove a general result concerning the approximations of values at rational points a/b of any G-function F with rational Taylor coefficients by fractions of the form n/(B…

We explore distribution questions for rational maps on the projective line $\mathbb{P}^1$ over $\mathbb{Q}$ within the framework of arithmetic dynamics, drawing analogies to elliptic curves. Specifically, we investigate counting problems…

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Let f(x) = x^d + a_{d-1}x^{d-1} + ... + a_0 be a polynomial of degree d in Q[x]. For every prime number p coprime to d and f(x) in (Z_p \cap Q)[x], let X/F_p be the Artin-Schreier curve defined by the affine equation y^p - y = f(x) mod p.…

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

We study the behavior of canonical height functions $\widehat{h}_f$, associated to rational maps $f$, on totally $p$-adic fields. In particular, we prove that there is a gap between zero and the next smallest value of $\widehat{h}_f$ on the…

Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to…

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the upper bound for the permanent with a…

We construct a family of iterations for computing the principal square root of a square matrix $A$ using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing…

We study the problem of simultaneous approximation to a fixed family of real and p-adic numbers by roots of integer polynomials of restricted type. The method that we use for this purpose was developed by H. Davenport and W.M. Schmidt in…

In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio smaller than $2$. The considered greedy algorithms and approaches based on linear programming involve the incorporation of…

Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we…