Results 1 to 10 of about 45 (45)
Basis Networks: Learning basis functions for free‐form triangulations
Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
On the automorphisms of the power semigroups of a numerical semigroup
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
Convergence and combinatorics of the Reverse algorithm
Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito +2 more
wiley +1 more source
Abstract The tropical n$n$‐gonal construction was introduced in recent work by the first author and D. Zakharov and structural results for n=2,3$n = 2,3$ were established. In this paper, we explore the construction for n=4$n = 4$ and prove a tropical analogue of Donagi's theorem which states that the tetragonal construction is a triality which ...
Felix Röhrle, Thomas Saillez
wiley +1 more source
Cartwright–Sturmfels Hilbert schemes
Abstract Let S$S$ be the Cox ring of a product of r$r$ projective spaces. In this paper, we study the Cartwright–Sturmfels Hilbert schemes of S$S$, which are multigraded Hilbert schemes that parameterize only radical ideals. Our main result shows that these Hilbert schemes are always smooth and irreducible if the Picard rank r$r$ is at most 2.
Ritvik Ramkumar, Alessio Sammartano
wiley +1 more source
Multiplicative irreducibility of shifted multiplicative subgroups
Abstract In a recent breakthrough, Kalmynin resolved conjectures of Lev–Sonn and Sárközy on additive decompositions of multiplicative subgroups of prime fields. In this paper, inspired by a related conjecture of Sárközy, we prove multiplicative analogues of Kalmynin's results. We show that for every proper multiplicative subgroup G$G$, the shifted set (
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
wiley +1 more source
Factorizations in Hecke algebras I: Long‐cycle factorizations and Jucys–Murphy elements
Abstract Given a permutation, there is a well‐developed literature studying the number of ways one can factor it into a product of other permutations subject to certain conditions. We initiate the analogous theory for the type‐A$A$ Iwahori–Hecke algebra by generalizing the notion of factorization in terms of the Jucys–Murphy elements.
Jose Bastidas +5 more
wiley +1 more source
Abstract We give a formula with explicit constants relating the subsurface projection dY(ν−,ν+)$d_Y(\nu ^-,\nu ^+)$ of the end invariants ν−,ν+$\nu ^-,\nu ^+$ of a hyperbolic 3‐manifold Q$Q$ diffeomorphic to S×R$S\times \mathbb {R}$ and the length of the geodesic representative in Q$Q$ of the multicurve ∂Y$\partial Y$.
Gabriele Viaggi
wiley +1 more source
On Matrix‐Based Cryptography Using Matrix Norm and Special Integer Sequences
ABSTRACT In this paper, a novel matrix‐based encryption approach based on the Affine Hill cipher is presented. The key matrix is constructed using the Narayana integer sequence, and the Frobenius norm of the key matrix is used as a scaling factor in the key construction.
Melih Göcen +1 more
wiley +1 more source

