Related papers: Regularized Products over arithmetic Schemes
We present two techniques novel in numerical methods. The first technique compiles the domain of the numerical methods as a discretized volume. Congruent elements are glued together to compile the domain over which the solution of a…
Let $\sigma$ denote an endomorphism of a smooth algebraic group $G$ over the algebraic closure of a finite field, and assume all iterates of $\sigma$ have finitely many fixed points. Steinberg gave a formula for the number of fixed points…
We have formalised Szemer\'edi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions, two major results in extremal graph theory and additive combinatorics, using the proof assistant Isabelle/HOL. For the latter formalisation, we…
A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb N$ is finitely colored, there must be some $\vec{x}$ with entries from $\mathbb N$ such that all entries of $A\vec{x}$ are in some color class. In…
In this paper, we give an approach to the zeta values of a (proper regular) arithmetic scheme X at the integers r>=d:=dim(X), using \'etale cohomology of X with Q_p(r) and Z_p(r)-coefficients.
Overdetermined systems of first kind integral equations appear in many applications. When the right-hand side is discretized, the resulting finite-data problem is ill-posed and admits infinitely many solutions. We propose a numerical method…
We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…
We further develop an algorithmic and diagrammatic computational framework for very general exact renormalization groups, where the embedded regularisation scheme, parametrised by a general cutoff function and infinitely many higher point…
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
A Hermite type formula is introduced and used to study the zeta function over the real and complex n-projective space. This approach allows to compute the residua at the poles and the value at the origin as well as the value of the…
Nontrivial fixed points of the hierarchical renormalization group are computed by numerically solving a system of quadratic equations for the coupling constants. This approach avoids a fine tuning of relevant parameters. We study the…
Work in progress concerning alternative formalizations of arithmetic.
In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…
We propose a new disjunctive regularization for mathematical programs with complementarity constraints (MPCC). Its feasible set coincides with that of the Kanzow-Schwartz regularization. However, their functional descriptions differ…
Here, we introduce a new definition of regular point for piecewise-linear (PL) functions on combinatorial (PL triangulated) manifolds. This definition is given in terms of the restriction of the function to the link of the point. We show…
We investigate continuous regularization methods for linear inverse problems of static and dynamic type. These methods are based on dynamic programming approaches for linear quadratic optimal control problems. We prove regularization…
The Riemann Hypothesis has been of central interest to mathematicians for a long time and many unsuccessful attempts have been made to either prove or disprove it. Since the Riemann zeta function is defined as a sum of the infinite number…
In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…