相关论文: Discrete and smooth orthogonal systems: $C^\infty$…
We propose a natural discretisation scheme for classical projective minimal surfaces. We follow the classical geometric characterisation and classification of projective minimal surfaces and introduce at each step canonical discrete models…
Consider discrete conformal maps defined on the basis of two conformally equivalent triangle meshes, that is edge lengths are related by scale factors associated to the vertices. Given a smooth conformal map $f$, we show that it can be…
Inspired by the Weierstrass representation of smooth affine minimal surfaces with indefinite metric, we propose a constructive process producing a large class of discrete surfaces that we call discrete affine minimal surfaces. We show that…
Discrete gradient methods are geometric integration techniques that can preserve the dissipative structure of gradient flows. Due to the monotonic decay of the function values, they are well suited for general convex and nonconvex…
Topology and geometry are deeply intertwined in the study of surfaces, though their interaction manifests differently in smooth and discrete settings. In the smooth category, a classical result asserts that any closed smooth surface…
Flatness of discrete-time systems can be characterized by two simple properties. There exists a map, a submersion, from the flat coordinates and their forward shifts to the state and the input of the discrete-time system, such that the…
Weingarten transformations which, by definition, preserve the asymptotic lines on smooth surfaces have been studied extensively in classical differential geometry and also play an important role in connection with the modern geometric…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
Let $Y\subset{\mathbb R}^n$ be a triangulable set and let $r$ be either a positive integer or $r=\infty$. We say that $Y$ is a $\mathscr{C}^r$-approximation target space, or a $\mathscr{C}^r\text{-}\mathtt{ats}$ for short, if it has the…
Computer vision systems in real-world applications need to be robust to partial occlusion while also being explainable. In this work, we show that black-box deep convolutional neural networks (DCNNs) have only limited robustness to partial…
We consider in this paper discrete improper affine spheres based on asymptotic nets. In this context, we distinguish the discrete edges and vertices that must be considered singular. The singular edges can be considered as discrete cuspidal…
The aim of this work is to develop a systematic manner to close overdetermined systems arising from conformal Killing tensors (CKT). The research performs this action for 1-tensor and 2-tensors. This research makes it possible to develop a…
We derive integrable discrete systems which are contiguity relations of two equations in the Painlev\'e-Gambier classification depending on some parameter. These studies extend earlier work where the contiguity relations for the six…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
We study the presence of abelian discrete symmetries in globally consistent orientifold compactifications based on rational conformal field theory. We extend previous work [1] by allowing the discrete symmetries to be a linear combination…
The methods of finite-gap integration are used to construct orthogonal curvilinear coordinate systems in the Euclidean space corresponding to sheaves of rank one without torsion over reducible singular spectral curves.
Motivated by the classical studies on transformations of conjugate nets, we develop the general geometric theory of transformations of their discrete analogues: the multidimensional quadrilateral lattices, i.e. lattices x: Z^N -> R^M, whose…
Discretizing variational principles, as opposed to discretizing differential equations, leads to discrete-time analogues of mechanics, and, systematically, to geometric numerical integrators. The phase space of such variational…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
Theorems from universal algebra such as that of Murski\u{i} from the 1970s have a striking similarity to universal approximation results for neural nets along the lines of Cybenko's from the 1980s. We consider here a discrete analogue of…