arXiv subjects

Mikhail Skopenkov

Publications and source records attributed to Mikhail Skopenkov.

At least 19 recordsLinked to original sources

arXiv2026

Patchwork: A compact representation for 3D polygonal shapes

We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds and the ability to approximate arbitrary shapes with arbitrary precision in any dimension. We propose an efficient gradient-based optimization scheme to fit Patchwork representations to 2D and 3D data, along with a novel regularization loss that progressively prunes redundant elements, yielding high compactness after convergence. Our approach offers fast fitting performance, a fraction of the required parameters compared to existing alternatives, and native support for inside-outside classification, making it a versatile and compact representation for geometric learning and reconstruction tasks, with future potential for 3D generation. Our implementation is available at: https://github.com/Ankbzpx/patchwork-experiment.

cs.GR↗

arXiv2025

Families of surfaces with constant ratio of principal curvatures and Plateau's problem

This work is on surfaces with a constant ratio of principal curvatures. These CRPC surfaces generalize minimal surfaces but are much more challenging to construct. We propose a construction of a family of such surfaces containing a given minimal surface without flat points. This leads to a partial solution of Plateau's problem for CRPC surfaces. We obtain analogous results in isotropic geometry. This work illustrates a general approach to solving Euclidean problems by starting with their isotropic analogs. Besides, we apply the method of successive approximations and analytic majorization.

math.DG↗

arXiv2025

Unlocking Euclidean Problems with Isotropic Initialization

Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous problems in isotropic geometry. Isotropic geometry can be viewed as a structure-preserving simplification of Euclidean geometry. The solutions found in the isotropic case give insight and can initialize optimization algorithms to solve the original Euclidean problems. We illustrate this general approach with three examples: quad-mesh mechanisms, composite asymptotic-geodesic gridshells, and asymptotic gridshells with constant node angle.

cs.CG↗

arXiv2024

Feynman checkers: through the looking-glass

Feynman gave a famous elementary introduction to quantum theory by discussing the thin-film reflection of light. We make his discussion mathematically rigorous, keeping it elementary, using his other idea. The resulting model leads to accurate quantitative results and allows us to derive a well-known formula from optics. In the process, we get acquainted with mathematical tools such as Smirnov's fermionic observables, transfer matrices, and spectral radii. Quantum walks and the six-vertex model arise as the next step in this direction.

math-ph↗

arXiv2023

Superport networks

We study multiport networks, common in electrical engineering. They have boundary conditions different from electrical networks: the boundary vertices are split into pairs and the sum of the incoming currents is set to be zero in each pair. If one sets the voltage difference for each pair, then the incoming currents are uniquely determined. We generalize Kirchhoff's matrix-tree theorem to this setup. Different forests now contribute with different signs, making the proof subtle. In particular, we use the formula for the response matrix minors by R. Kenyon-D. Wilson, determinantal identities, and combinatorial bijections. We introduce superport networks, generalizing both ordinary networks and multiport ones.

math.CO↗

arXiv2023

Surfaces of constant principal-curvatures ratio in isotropic geometry

We study surfaces with a constant ratio of principal curvatures in Euclidean and simply isotropic geometries and characterize rotational, channel, ruled, helical, and translational surfaces of this kind under some technical restrictions (the latter two cases only in isotropic geometry). We use the interlacing of various methods of differential geometry, including line geometry and Lie sphere geometry, ordinary differential equations, and elementary algebraic geometry.

math.DG↗

arXiv2023

Analysis and Synthesis of Digital Dyadic Sequences

We explore the space of matrix-generated (0, m, 2)-nets and (0, 2)-sequences in base 2, also known as digital dyadic nets and sequences. In computer graphics, they are arguably leading the competition for use in rendering. We provide a complete characterization of the design space and count the possible number of constructions with and without considering possible reorderings of the point set. Based on this analysis, we then show that every digital dyadic net can be reordered into a sequence, together with a corresponding algorithm. Finally, we present a novel family of self-similar digital dyadic sequences, to be named $\xi$-sequences, that spans a subspace with fewer degrees of freedom. Those $\xi$-sequences are extremely efficient to sample and compute, and we demonstrate their advantages over the classic Sobol (0, 2)-sequence.

cs.GR↗

arXiv2023

A generalization of Cardy's and Schramm's formulae

We study critical site percolation on the triangular lattice. We find the difference of the probabilities of having a percolation interface to the right and to the left of two given points in the scaling limit. This generalizes both Cardy's and Schramm's formulae. The generalization involves a new interesting discrete analytic observable and an unexpected conformal mapping.

math.PR↗

arXiv2023

Discrete field theory: symmetries and conservation laws

We present a general algorithm constructing a discretization of a classical field theory from a Lagrangian. We prove a new discrete Noether theorem relating symmetries to conservation laws and an energy conservation theorem not based on any symmetry. This gives exact conservation laws for several theories, e.g., lattice electrodynamics and gauge theory. In particular, we construct a conserved discrete energy-momentum tensor, approximating the continuum one at least for free fields. The theory is stated in topological terms, such as coboundary and products of cochains.

math-ph↗

arXiv2022

Motion Polynomials Admitting a Factorization with Linear Factors

Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear factors, and we give an algorithm to compute them. We can use those linear factors to construct mechanisms because the factorization corresponds to the decomposition of the rational motion into simple rotations or translations. Bounded motion polynomials always admit a factorization into linear factors after multiplying with a suitable real or quaternion polynomial. Our criterion for factorizability allows us to improve on earlier algorithms to compute a suitable real or quaternion polynomial co-factor.

math.RA↗

arXiv2022

Feynman checkers: lattice quantum field theory with real time

We present a new completely elementary model that describes the creation, annihilation, and motion of non-interacting electrons and positrons along a line. It is a modification of the model known under the names Feynman checkers or one-dimensional quantum walk. It can be viewed as a six-vertex model with certain complex weights of the vertices. The discrete model is consistent with the continuum quantum field theory, namely, reproduces the known expected charge density as the lattice step tends to zero. It is exactly solvable in terms of hypergeometric functions. We introduce interaction resembling Fermi's theory and establish perturbation expansion.

math-ph↗

arXiv2020

Lattice gauge theory and a random-medium Ising model

We study linearization of lattice gauge theory. Linearized theory approximates lattice gauge theory in the same manner as the loop O(n)-model approximates the spin O(n)-model. Under mild assumptions, we show that the expectation of an observable in linearized Abelian gauge theory coincides with the expectation in the Ising model with random edge-weights. We find a similar relation between Yang-Mills theory and 4-state Potts model. For the latter, we introduce a new observable.

math-ph↗

arXiv2020

Ruled Laguerre minimal surfaces

A Laguerre minimal surface is an immersed surface in the Euclidean space being an extremal of the functional \int (H^2/K - 1) dA. In the present paper, we prove that the only ruled Laguerre minimal surfaces are up to isometry the surfaces R(u,v) = (Au, Bu, Cu + D cos 2u) + v (sin u, cos u, 0), where A, B, C, D are fixed real numbers. To achieve invariance under Laguerre transformations, we also derive all Laguerre minimal surfaces that are enveloped by a family of cones. The methodology is based on the isotropic model of Laguerre geometry. In this model a Laguerre minimal surface enveloped by a family of cones corresponds to a graph of a biharmonic function carrying a family of isotropic circles. We classify such functions by showing that the top view of the family of circles is a pencil.

math.DG↗

arXiv2020

Characterizing envelopes of moving rotational cones and applications in CNC machining

Motivated by applications in CNC machining, we provide a characterization of surfaces which are enveloped by a one-parametric family of congruent rotational cones. As limit cases, we also address developable surfaces and ruled surfaces. The characterizations are higher order nonlinear PDEs generalizing the ones by Gauss and Monge for developable surfaces and ruled surfaces, respectively. The derivation includes results on local approximations of a surface by cones of revolution, which are expressed by contact order in the space of planes. These results are themselves of interest in geometric computing, for example in cutter selection and positioning for flank CNC machining.

math.DG↗

arXiv2019

On approximability by embeddings of cycles in the plane

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s vertices. Let f be a simplicial map of the graph S to the plane. The map f is approximable by embeddings if and only if for each i=0,...,s the i-th derivative of the map f (defined by Minc) neither contains transversal self-intersections nor is the standard winding of degree greater than 1. We deduce from the Minc result the completeness of the van Kampen obstruction to approximability by embeddings of piecewise linear maps of a segment to the plane. We also generalize these criteria to simplicial maps of a graph without vertices of degree >3 to a circle.

math.GT↗

arXiv2016

Suspension theorems for links and link maps

We present a new short proof of the explicit formula for the group of links (and also link maps) in the 'quadruple point free' dimension. Denote by $L^m_{p,q}$ (respectively, $C^{m-p}_p$) the group of smooth embeddings $S^p\sqcup S^q\to S^m$ (respectively, $S^p\to S^m$) up to smooth isotopy. Denote by $LM^m_{p,q}$ the group of link maps $S^p\sqcup S^q\to S^m$ up to link homotopy. Theorem 1. If $p\le q\le m-3$ and $2p+2q\le 3m-6$ then \begin{equation*} L^m_{p,q}\cong π_p(S^{m-q-1})\oplusπ_{p+q+2-m}(SO/SO_{m-p-1})\oplus C^{m-p}_p\oplus C^{m-q}_q. \end{equation*} Theorem 2. If $p, q\le m-3$ and $2p+2q\le 3m-5$ then $LM^m_{p,q}\cong π^S_{p+q+1-m}$. Our approach is based on the use of the suspension operation for links and link maps, and suspension theorems for them.

math.GT↗

arXiv2015

When is the set of embeddings finite up to isotopy?

Given a manifold N and a number m, we study the following question: is the set of isotopy classes of embeddings N->S^m finite? In case when the manifold N is a sphere the answer was given by A. Haefliger in 1966. In case when the manifold N is a disjoint union of spheres the answer was given by D. Crowley, S. Ferry and the author in 2011. We consider the next natural case when N is a product of two spheres. In the following theorem, FCS(i,j) is a concrete subset of the integer lattice depending only on the parity of i and j which is defined in the paper. Theorem. Assume that m>2p+q+2 and m S^m is infinite if and only if either q+1 or p+q+1 is divisible by 4, or there exists a point (x,y) in the set FCS(m-p-q,m-q) such that (m-p-q-2)x+(m-q-2)y=m-3. Our approach is based on a group structure on the set of embeddings and a new exact sequence, which in some sense reduces the classification of embeddings S^p x S^q -> S^m to the classification of embeddings S^{p+q} |_| S^q -> S^m and D^p x S^q -> S^m. The latter classification problems are reduced to homotopy ones, which are solved rationally.

math.GT↗

arXiv2015

Surfaces containing two circles through each point and Pythagorean 6-tuples

We study analytic surfaces in 3-dimensional Euclidean space containing two circular arcs through each point. The problem of finding such surfaces traces back to the works of Darboux from XIXth century. We reduce finding all such surfaces to the algebraic problem of finding all Pythagorean 6-tuples of polynomials. The reduction is based on the Schicho parametrization of surfaces containing two conics through each point and a new approach using quaternionic rational parametrization.

math.AG↗