相关论文: Local and global methods in arithmetic (in Russian…

In this work, we present a systematic approach to investigate the existence, multiplicity, and local gradient regularity of solutions for nonlocal quasilinear equations with local gradient degeneracy. Our method involves an interactive…

In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\equiv1\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\log_2(M)$…

We study the globalization of partial actions on sets and topological spaces and of partial coactions on algebras by applying the general theory of globalization for geometric partial comodules, as previously developed by the authors. We…

Numerical optimization for the inverse design of photonic structures is a tool which is providing increasingly convincing results -- even though the wave nature of problems in photonics makes them particularly complex. In the meantime, the…

We consider the representation of real numbers by alternating Perron series ($P^-$-representation), which is a generalization of representations of real numbers by Ostrogradsky-Sierpi\'nski-Pierce series (Pierce series), alternating…

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…

In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "physical" computation systems whose computational capabilities…

Grover's algorithm can be employed in global optimization methods providing, in some cases, a quadratic speedup over classical algorithms. This paper describes a new method for continuous global optimization problems that uses a classical…

We study congruences relating Fourier coefficients of meromorphic modular forms and Frobenius eigenvalues of elliptic curves corresponding to their poles. We develop a $p$-adic cohomological framework that interprets these congruences via…

Let $p$ be a prime number. Motivated by the local lifting problem for $(\mathbb{Z}/p\mathbb{Z})^n$ with $n>1$, we prove several new results on certain $\mathbb{F}_p$-vector spaces of logarithmic differential forms on the projective line in…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic…

A method of local approximation of holomorphic solutions of algebraic equations is discussed

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

Methods for the reduction of the complexity of computational problems are presented, as well as their connections to renormalization, scaling, and irreversible statistical mechanics. Several statistically stationary cases are analyzed; for…

Let $G$ be a connected reductive group over a totally real field $F$ which is compact modulo center at archimedean places. We find congruences modulo an arbitrary power of p between the space of arbitrary automorphic forms on $G(\mathbb…