相关论文: Linear precision for parametric patches
Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
We prove that a topological group is isomorphic to the real line if and only if it is a one-parameteric, metrizable, and not monothetic. This result is used in the authors' other paper to prove that one-parametric groups in strictly convex…
In this article we study infinitesimal deformations of toric hypersurfaces. We introduce a Kodaira-Spencer map and compute its kernel. By introducing some new Laurent polynomials we make our computation as explicit as possible. This widely…
The purpose of this paper is to exhibit infinite families of conjugate projective curves in a number field whose complement have the same abelian fundamental group, but are non-homeomorphic. In particular, for any $d>3$ we find Zariski…
Modern applications require methods that are computationally feasible on large datasets but also preserve statistical efficiency. Frequently, these two concerns are seen as contradictory: approximation methods that enable computation are…
We examine data-processing of Markov chains through the lens of information geometry. We first establish a theory of congruent Markov morphisms within the framework of stochastic matrices. Specifically, we introduce and justify the concept…
We introduce cosurfaces with values in the group \(\PC_n(H)\) of \(H\)-valued reciprocal pairwise comparison matrices. The composition law is covariant on upper triangular coefficients and contravariant on lower triangular coefficients,…
We study how much a linear program (LP) can be compressed when solved repeatedly, given prior knowledge about its objective function. Existing data-driven projection methods learn low-dimensional surrogate LPs with approximate…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
We present a general setting in which the formula describing the linear response of the physical measure of a perturbed system can be obtained. In this general setting we obtain an algorithm to rigorously compute the linear response. We…
The problem of defining correctly geometric objects such as the curvature is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs.…
This paper presents a brand new methodology to deal with isotopic fine structure calculations. By using the Poisson approximation in an entirely novel way, we introduce mathematical elegance into the discussion on the trade-off between…
We provide results demonstrating the smoothness of some marginal log-linear parameterizations for distributions on multi-way contingency tables. First we give an analytical relationship between log-linear parameters defined within different…
By means of toric geometry we study hypersurfaces in weighted projective space of dimension four. In particular we compute for a given manifold its intrinsic topological coupling. We find that the result agrees with the calculation of the…
These lecture notes are an introduction to toric geometry. Particular focus is put on the description of toric local Calabi-Yau varieties, such as needed in applications to the AdS/CFT correspondence in string theory. The point of view…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
Choosing the right representation for geometry is crucial for making 3D models compatible with existing applications. Focusing on piecewise-smooth man-made shapes, we propose a new representation that is usable in conventional CAD modeling…
In this paper, we prove sharp estimates for the average cost of the optimal matching problem on the flat 2-torus, using quantitative linearization and the method of trajectories.
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…