43 citations · 163 across the 20 of their papers we have counts for
26 papers
Matrix-tree theorem for cohomological electrical networks
Pavlo Pylyavskyy, Svetlana Shirokovskikh, Mikhail Skopenkov
We introduce a new type of boundary condition for electrical networks by specifying a cohomology class on the underlying cell complex. As special and limiting cases, we recover the…
Superport networks
Pavlo Pylyavskyy, Svetlana Shirokovskikh, Mikhail Skopenkov
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…
Surfaces of constant principal-curvatures ratio in isotropic geometry
Khusrav Yorov, Mikhail Skopenkov, Helmut Pottmann
We study surfaces with a constant ratio of principal curvatures in Euclidean and simply isotropic geometries and characterize rotational, channel, ruled, helical, and translational…
Analysis and Synthesis of Digital Dyadic Sequences
Abdalla G. M. Ahmed, Mikhail Skopenkov, Markus Hadwiger +1
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 lea…
A generalization of Cardy's and Schramm's formulae
Mikhail Khristoforov, Mikhail Skopenkov, Stanislav Smirnov
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 give…
Lattice gauge theory and a random-medium Ising model
Mikhail Skopenkov
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. Unde…