Related papers: p-adic integration on bad reduction hyperelliptic …
In this paper we are concerned with a class of optimization problems involving the $p(x)$-Laplacian operator, which arise in imaging and signal analysis. We study the well-posedness of this kind of problems in an amalgam space considering…
Cohomology of affinoids does not behave well; often, this can be remedied by making affinoids overconvergent. In this paper, we focus on dimension 1 and compute, using analogs of pants decompositions of Riemann surfaces, various…
We study properly embedded and immersed p(pseudohermitian)-minimal surfaces in the 3-dimensional Heisenberg group. From the recent work of Cheng, Hwang, Malchiodi, and Yang, we learn that such surfaces must be ruled surfaces. There are two…
Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…
In this work, an adaptive edge element method is developed for an H(curl)-elliptic constrained optimal control problem. We use the lowest-order Nedelec's edge elements of first family and the piecewise (element-wise) constant functions to…
The main purpose of this paper is to give an overview over the theory of abelian varieties, with main focus on Jacobian varieties of curves reaching from well-known results till to latest developments and their usage in cryptography. In the…
We develop an efficient and convergent numerical method for solving the inverse problem of determining the potential of nonlinear hyperbolic equations from lateral Cauchy data. In our numerical method we construct a sequence of linear…
We establish a relation between intersection numbers of special cycles on a Shimura curve and special values of derivatives of metaplectic Eisenstein series at a place of bad reduction where p-adic uniformization in the sense of Cherednik…
We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is $c$, the…
Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving hard integer polynomial optimization problems. Available hardware restricts the Hamiltonians to be of a structure that allows only pairwise interactions. This requires…
We propose an algorithm for the computational homogenization of locally periodic hyperelastic structures undergoing large deformations due to external quasi-static loading. The algorithm performs clustering of macroscopic deformations into…
This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a…
We present the proof of several inequalities using the technique introduced by Alexandroff, Bakelman, and Pucci to establish their ABP estimate. First, we give a new and simple proof of a lower bound of Berestycki, Nirenberg, and Varadhan…
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…
We develop a $p$-adic theory of periods for 1-motives, extending the classical theory of complex periods into the non-archimedean setting. For 1-motives with good reduction over $p$-adic local fields, we construct a $p$-adic integration…
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…
This paper deals with connections on $p$-adic analytic curves, in the sense of Berkovich. The curves must be compact but the connections are allowed to have a finite number of meromorphic singularities on them. For any choice of a…
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…
In a previous work, we developed the idea to solve Kepler's equation with a CORDIC-like algorithm, which does not require any division, but still multiplications in each iteration. Here we overcome this major shortcoming and solve Kepler's…
We study summation of sequences and integration in the quantum model of computation. We develop quantum algorithms for computing the mean of sequences which satisfy a p-summability condition and for integration of functions from Lebesgue…