Search

We define spherical Heron triangles (spherical triangles with "rational" side-lengths and angles) and parametrize them via rational points of certain families of elliptic curves. We show that the congruent number problem has infinitely many solutions for most areas in the spherical setting and we find a spherical Heron triangle with rational medians. We also explore the question of spherical triangles with a single rational median or a single a rational area bisector (median splitting the triangle in half), and discuss various problems involving isosceles spherical triangles., Comment: 22 pages, 2 figures

We investigate the triangulated hull of the orbit categories of the perfect derived category and the bounded derived category of a ring concerning the power of the suspension functor. It turns out that the triangulated hull will correspond to the full subcategory of compact objects of certain triangulated categories of periodic complexes. This specializes to Stai and Zhao's result when the ring is a finite dimensional algebra with finite global dimension over a field. As the first application, if $A,B$ are flat algebras over a commutative ring and they are derived equivalent, then the corresponding derived categories of $n$-periodic complexes are triangle equivalent. As the second application, we get the periodic version of the Koszul duality., 22 pages

We investigate the planarity of the boundaries of right-angled Coxeter groups. We show that non-planarity of the defining graph does not necessarily imply non-planarity of every boundary of the associated right-angled Coxeter group, although it does in many cases. Our techniques yield a characterization of the triangle-free defining graphs such that the associated right-angled Coxeter group has boundary a Menger curve.

The purpose of this note is to give a simple proof for a necessary and sufficient condition for visibility paths in simple polygons. A visibility path is a curve such that every point inside a simple polygon is visible from at least one point on the path. This result is essential for finding the shortest watchman route inside a simple polygon specially when the route is restricted to curved paths.

We consider an embedding of planar maps into an equilateral triangle $\Delta$ which we call the Cardy embedding. The embedding is a discrete approximation of a conformal map based on percolation observables that are used in Smirnov's proof of Cardy's formula. Under the Cardy embedding, the planar map induces a metric and an area measure on $\Delta$ and a boundary measure on $\partial \Delta$. We prove that for uniformly sampled triangulations, the metric and the measures converge jointly in the scaling limit to the Brownian disk conformally embedded into $\Delta$ (i.e., to the $\sqrt{8/3}$-Liouville quantum gravity disk). As part of our proof, we prove scaling limit results for critical site percolation on the uniform triangulations, in a quenched sense. In particular, we establish the scaling limit of the percolation crossing probability for a uniformly sampled triangulation with four boundary marked points., Comment: 66 pages, 13 figures. Revised according to referee report. Accepted for publication in Acta Mathematica

For each of (i) arbitrary stochastic reset, (ii) deterministic reset with arbitrary period, (iii) reset at arbitrary constant rate, and then in the sense of either (a) first-order stochastic dominance or (b) expectation (i.e. for each of the six possible combinations of the preceding), those laws of random times are precisely characterized that are rendered no bigger [rendered no smaller; left invariant] by all possible restart laws (within the classes (i), (ii), (iii), as the case may be). Partial results in the same vein for reset with branching are obtained. In particular it is found that deterministic and arbitrary stochastic restart lead to the same characterizations, but this equivalence fails to persist for exponential (constant-rate) reset.

The aim of this work is to study the rigidity problem for Steiner's inequality for the anisotropic perimeter, that is, the situation in which the only extremals of the inequality are vertical translations of the Steiner symmetral that we are considering. Our main contribution consists in giving conditions under which rigidity in the anisotropic setting is equivalent to rigidity in the Euclidean setting. Such conditions are given in term of a restriction to the possible values of the normal vectors to the boundary of the Steiner symmetral (see Corollary 1.17, and Corollary 1.18).

Any two geometric ideal triangulations of a cusped complete hyperbolic $3$-manifold $M$ are related by a sequence of Pachner moves through topological triangulations. We give a bound on the length of this sequence in terms of the total number of tetrahedra and a lower bound on dihedral angles. This leads to a naive but effective algorithm to check if two hyperbolic knots are equivalent, given geometric ideal triangulations of their complements. Given a geometric ideal triangulation of $M$, we also give a lower bound on the systole length of $M$ in terms of the number of tetrahedra and a lower bound on dihedral angles., Comment: Exposition improved, more figures added, no change to statements of Theorems. This version is accepted for publication in the journal Algebraic & Geometric Topology

Building on H. Tran's study of Loewner hulls generated by complex-valued driving functions, which showed the existence of a phase transition, we answer the question of whether the phase transition for complex-driven hulls matches the phase transition for real-driven hulls. This is accomplished through a detailed study of the Loewner hulls generated by driving functions $c\sqrt{1-t}$ and $c\sqrt{\tau + t}$ for $c \in \mathbb{C}$ and $\tau \geq 0$. This family also provides examples of new geometric behavior that is possible for complex-driven hulls but prohibited for real-driven hulls.

Most finite element models of small arms focus on an idealized barrel, typically one with a perfectly straight bore centerline. Using five different experimentally measured bore centerlines, this investigation analyzes the effect centerline nonlinearity has on projectile exit conditions. This includes the effect of rotating a centerline through several orientations. Modeled using Abaqus/Explicit, this dynamic analysis simulates a single firing cycle for each centerline. Projectile jump is calculated for each model as a measure of the effects of warped centerlines. The warped centerlines have a small effect on barrel dynamics.

We classify completely the infinite, planar triangulations satisfying a weak spatial Markov property, without assuming one-endedness nor finiteness of vertex degrees. In particular, the Uniform Infinite Planar Triangulation (UIPT) is the only such triangulation with average degree 6. As a consequence, we prove that the convergence of uniform triangulations of the sphere to the UIPT is robust, in the sense that it is preserved under various perturbations of the uniform measure. As another application, we obtain large deviation estimates for the number of occurencies of a pattern in uniform triangulations., 22 pages, 2 figures

It is known that for every $\alpha \geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $\Theta(r^\alpha)$. We prove that for $\alpha, Comment: Revised version submitted to Annales Henri Lebesgue

Given a finite point set P in general position in the plane, a full triangulation of P is a maximal straight-line embedded plane graph on P. A partial triangulation of P is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge (called edge flip), removes a non-extreme point of degree 3, or adds a point in P \ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The edge flip graph is defined with full triangulations as vertices, and edge flips determining the adjacencies. Lawson showed in the early seventies that these graphs are connected. The goal of this paper is to investigate the structure of these graphs, with emphasis on their vertex connectivity. For sets P of n points in the plane in general position, we show that the edge flip graph is inverted right perpendicularn/2 - 2inverted left perpendicular-vertex connected, and the bistellar flip graph is (n - 3)-vertex connected; both results are tight. The latter bound matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points to 3-space and projecting back the lower convex hull), where (n - 3)-vertex connectivity has been known since the late eighties through the secondary polytope due to Gelfand, Kapranov, & Zelevinsky and Balinski's Theorem. For the edge flip-graph, we additionally show that the vertex connectivity is at least as large as (and hence equal to) the minimum degree (i.e., the minimum number of flippable edges in any full triangulation), provided that n is large enough. Our methods also yield several other results: (i) The edge flip graph can be covered by graphs of polytopes of dimension inverted right pependicularn/2 - 2inverted left pependicular (products of associahedra) and the bistellar flip graph can be covered by graphs of polytopes of dimension n - 3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n - 3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations of a point set are regular iff the partial order of partial subdivisions has height n - 3. (iv) There are arbitrarily large sets P with non-regular partial triangulations and such that every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular triangulations., Discrete & Computational Geometry, 68 (4), ISSN:0179-5376, ISSN:1432-0444

Let $\mathcal{P}$ be a simple thin polyomino and $\Bbbk$ a field. Let $R$ be the toric $\Bbbk$-algebra associated to $\mathcal{P}$. Write the Hilbert series of $R$ as $h_{R}(t)/(1-t)^{\dim(R)}$. We show that $$(-1)^{\left\lfloor{\frac{\mathrm{deg} h_R(t)}{2}}\right\rfloor}h_{R}(-1) \geq 0$$ if $R$ is Gorenstein. This shows that the Gorenstein rings associated to simple thin polyominoes satisfy the Charney-Davis conjecture., Comment: To appear in Communications in Algebra

Recently, Nakaoka and Palu introduced a notion of extriangulated categories. This is a unification of exact categories and triangulated categories. In this paper, we generalize the definitions of Hall algebras of exact categories and triangulated categories to extriangulated categories., 21 pages

In this paper, we show that for all triangles in the plane, the equilateral triangle maximizes the ratio of the first two Dirichlet-Laplacian eigenvalues. This is an extension of work by Siudeja, who proved the inequality in the case of acute triangles. The proof utilizes inequalities due to Siudeja and Freitas, together with improved variational bounds., Comment: 16 pages, 4 figures

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits an $(1+\varepsilon)$-spanners with $O(n)$ edges and weight proportional to that of the Euclidean MST of $S$. In a recent breakthrough, Le and Solomon (2019) established the precise dependencies on $\varepsilon>0$, for constant $d\in \mathbb{N}$, of the minimum lightness and sparsity of $(1+\varepsilon)$-spanners, and observed that Steiner points can substantially improve the lightness and sparsity of a $(1+\varepsilon)$-spanner. They gave upper bounds of $\tilde{O}(\varepsilon^{-(d+1)/2})$ for the minimum lightness in dimensions $d\geq 3$, and $\tilde{O}(\varepsilon^{-(d-1)/2})$ for the minimum sparsity in $d$-space for all $d\geq 1$. In this work, we improve several bounds on the lightness and sparsity of Euclidean Steiner $(1+\varepsilon)$-spanners. We establish lower bounds of $\Omega(\varepsilon^{-d/2})$ for the lightness and $\Omega(\varepsilon^{-(d-1)/2})$ for the sparsity of such spanners in Euclidean $d$-space for all constant $d\geq 2$. Our lower bound constructions generalize previous constructions by Le and Solomon, but the analysis substantially simplifies previous work, using new geometric insight, focusing on the directions of edges. Next, we show that for every finite set of points in the plane and every $\varepsilon\in (0,1]$, there exists a Euclidean Steiner $(1+\varepsilon)$-spanner of lightness $O(\varepsilon^{-1})$; this matches the lower bound for $d=2$. We generalize the notion of shallow light trees, which may be of independent interest, and use directional spanners and a modified window partitioning scheme to achieve a tight weight analysis., Comment: This combines two previous papers appeared in STACS'21 (arXiv:2010.02908) and SoCG'21 (arXiv:2012.02216), and is to appear in SIAM Journal on Discrete Mathematics

A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in $\mathbb{R}^2\setminus \Omega$, where $\Omega$ is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon. We prove that the presented algorithms guarantees a $\approx 22.77$ competitive ratio compared to the optimal offline watchman path.

The evolute of a curve is the envelope of its normals. In this note we consider a projectively natural discrete analog of this construction: we define projective perpendicular bisectors of the sides of a polygon in the projective plane, and study the map that sends a polygon to the new polygon formed by the projective perpendicular bisectors of its sides. We consider this map acting on the moduli space of projective polygons. We analyze the case of pentagons; the moduli space is 2-dimensional in this case. The second iteration of the map has one integral whose level curves are cubic curves, and the transformation on these level curves is conjugated to the map $x\mapsto -4x$ mod 1. We also present the results of an experimental study in the case of hexagons.

A lattice equable quadrilateral is a quadrilateral in the plane whose vertices lie on the integer lattice and which is equable in the sense that its area equals its perimeter. This paper treats the tangential and extangential cases. We show that up to Euclidean motions, there are only 6 convex tangential lattice equable quadrilaterals, while the concave ones are arranged in 7 infinite families, each being given by a well known Diophantine equation of order 2 in 3 variables. On the other hand, apart from the kites, up to Euclidean motions there is only one concave extangential lattice equable quadrilateral, while there are infinitely many convex ones.

A $configuration$ of a linkage $\Gamma$ is a possible positioning of $\Gamma$ in $\mathbb{R}^d$ and the collection of all such forms the configuration space $\mathcal{C}(\Gamma)$ of $\Gamma$. We here introduce the notion of the $symmetric configuration space$ of a linkage, in which we identify configurations which are geometrically indistinguishable. We show that the symmetric configuration space of a planar polygon has a regular cell structure, provide some principles for calculating this structure, and give a complete description of the symmetric configuration space of all quadrilaterals and of the equilateral pentagon., Comment: 45 pages, 29 figures

We study $μ$-stabilizers for groups definable in ACVF in the valued field sort. We prove that $\mathrm{Stab}^μ(p)$ is an infinite unbounded definable subgroup of $G$ when $p$ is standard and unbounded. In the particular case when $G$ is linear algebraic, we show that $\mathrm{Stab}^μ(p)$ is a solvable algebraic subgroup of $G$, with $\mathrm{dim}(\mathrm{Stab}^μ(p))=\mathrm{dim}(p)$ when $p$ is $μ$-reduced and unbounded., 15 pages

A finite-time singularity of 2D harmonic map flow will be called "strictly type-II" if the outer energy scale satisfies $\lambda(t) = O(T - t)^{\frac{1 + \alpha}{2}}.$ We prove that the body map at a strict type-II blowup is H\"older continuous., Comment: Final version, to appear in Proc. AMS (omitting first appendix)

It is often said that Newton’s Law II was neglected in 18th century Germany. In fact, also Kant’s law of mechanics lacked Law II. Exactly, however, the theories of laws of motion were so various that we cannot conclude that Law II was nowhere formulated at that time. Especially, many natural philosophers who belong to Newtonian eclectics re-formulated Law II in their own ways. Their explanation of Law II was different from Newtonian mechanics today because they assumed the case where the motion is communicated by the force, which is proportional to “mv” (rather than “ma”), in the collision of two bodies. Given this, to investigate Kant’s theory of mechanics, it is inevitable to consider the textbooks by Newtonian eclectics.

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically constrained quadratic optimization problem. We propose to solve this problem with a sequential convex optimization approach, which is an ascent algorithm guaranteeing convergence to a locally optimal solution. Numerical experiments on polygons with up to $n=128$ sides suggest that the optimal solutions obtained are near-global. Indeed, for even $6 \le n \le 12$, the algorithm proposed in this work converges to known global optimal solutions found in the literature.

A small polygon is a polygon that has diameter one. The maximal perimeter of a convex equilateral small polygon with $n=2^s$ sides is not known when $s \ge 4$. In this paper, we construct a family of convex equilateral small $n$-gons, $n=2^s$ and $s \ge 4$, and show that their perimeters are within $O(1/n^4)$ of the maximal perimeter and exceed the previously best known values from the literature. In particular, for the first open case $n=16$, our result proves that Mossinghoff's equilateral hexadecagon is suboptimal.

Let $\xi_1,\xi_2,\ldots$ be a sequence of independent copies of a random vector in $\mathbb R^d$ having an absolutely continuous distribution. Consider a random walk $S_i:=\xi_1+\cdots+\xi_i$, and let $C_{n,d}:=\text{conv}(0,S_1,S_2,\ldots,S_n)$ be the convex hull of the first $n+1$ points it has visited. The polytope $C_{n,d}$ is called $k$-neighborly if for every indices $0\leq i_0, Comment: 40 pages, 6 figures. Minor changes compared to the previous version

In this work, we bring to light the properties of newly formed polynomial sequences at each vertex of Pell polynomial sequences placed clockwise at each vertex in the n-gon. We compute the relation among the polynomials with such vertices. Moreover, in an n-gon, we generate a recurrence relation for a sequence giving the mth term formed at the kth. Similar to the situations we are talking about, we applied to Pell-Lucas polynomials, Jacobsthal polynomials, and Jacobsthal-Lucas polynomials and have obtained new relations recurrence.

We study the critical points of Laplace eigenfunctions on polygonal domains with a focus on the second Neumann eigenfunction. We show that if each convex quadrilaterals has no second Neumann eigenfunction with an interior critical point, then there exists a convex quadrilateral with an unstable critical point. We also show that each critical point of a second-Neumann eigenfunction on a Lip-1 polygon with no orthogonal sides is an acute vertex., Comment: 30 pages, 1 figure

This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that share them. The algorithm is termed Polylla and is divided into three phases. The first phase consists of labeling each edge of the input triangulation according to its size; the second phase builds polygons (simple or not) from terminal-edges regions using the label system; and the third phase transforms each non simple polygon into simple ones. The final mesh contains polygons with convex and non convex shape. Since Voronoi based meshes are currently the most used polygonal meshes, we compare some geometric properties of our meshes against constrained Voronoi meshes. Several experiments were run to compare the shape and size of polygons, the number of final mesh points and polygons. For the same input, Polylla meshes contain less polygons than Voronoi meshes, and the algorithm is simpler and faster than the algorithm to generate constrained Voronoi meshes. Finally, we have validated Polylla meshes by solving the Laplace equation on an L-shaped domain using the Virtual Element Method (VEM). We show that the numerical performance of the VEM using Polylla meshes and Voronoi meshes is similar.

Many real world applications require large-scale sensor networks deployed on the surface of a complex 3D terrain. Compared with planar and 3D network localizations, terrain surface network localization generates unique and fundamental hardness. We explore 3D surface network localization with terrain models. A digital terrain model (DTM), available to public with a variable resolution up to one meter, is a 3D representation of a terrain's surface. The constraint that the sensors must be on the known 3D terrain's surface ensures that the triangular meshes of the network and the terrain's surface overlap and approximate the same geometric shape. The basic idea of both the anchor-based and anchor-free localization algorithms is to map the two triangular meshes extracted from the connectivity graph of a sensor network and the DTM of its deployed terrain surface to plane. With the well-aligned triangular meshes of a network and its deployed terrain surface on plane, each sensor node of the network can easily locate reference grid points from the DTM of the terrain to calculate its own geographic location.

In this paper, we prove the monotonicity of the anisotropic perimeter of sets of finite perimeter under Steiner symmetrization by a variational formula of volume and an inequality for the anisotropic lower outer Minkowski content. As a consequence, we give a more direct proof of the Wulff inequality by Steiner symmetrization.

Isovist fields are powerful tools for expressing and analyzing spatial configurations. There is also useful software that allows one to calculate the isovist field variables. However, the complexity and the speed of the isovist field production algorithms have limited the diverse uses of isovist fields as a spatial configuration expressive model. In this paper, we present an algorithm for generating the isovist field which is simpler than the rivals. This algorithm relies on calculating the isovist for the corner points before generating the isovist fields. A complementary algorithm is also proposed which quickly updates isovist field calculations after limited changes in the environment take place. The speeds of these two algorithms are also checked here in real cases and are compared to the well-known fast algorithms. In addition, more efficient methods are proposed to calculate variables related to distance-to-the-walls metrics within an isovist. This method, which is fast and accurate, uses slices of isovist as a base to calculate these variables with the help of integral calculations. We hope these methods accelerate the evolution of isovist field models and help make algorithmic design based on isovist fields a more convenient technique.

In this paper we provide an abstract characterization of the inverse hulls of semigroups associated with Markov shifts. As an application of the characterization we give an example of Markov shifts that are not conjugate, but have isomorphic inverse hulls., Comment: 15 pages, 2 figures

We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the following quantitative Helly-type result for the \emph{diameter}. If $K$ is the intersection of finitely many convex bodies in $\mathbb{R}^d$, then one can select $2d$ of these bodies whose intersection is of diameter at most $(2d)^3\mathrm{diam}(K)$. The best previously known estimate, due to Brazitikos, is $c d^{11/2}$. Moreover, we confirm that the multiplicative factor $c d^{1/2}$ conjectured by B\'ar\'any, Katchalski and Pach cannot be improved., Comment: Some typos fixed

Various computer simulations regarding, e.g., the weather or structural mechanics, solve complex problems on a two-dimensional domain. They mostly do so by splitting the input domain into a finite set of smaller and simpler elements on which the simulation can be run fast and efficiently. This process of splitting can be automatized by using subdivision schemes. Given the wide range of simulation problems to be tackled, an equally wide range of subdivision schemes is available. They create subdivisions that are (mainly) comprised of triangles, quadrilaterals, or hexagons. Furthermore, they ensure that (almost) all vertices have the same number of neighboring vertices. This paper illustrates a subdivision scheme that splits the input domain into pentagons. Repeated application of the scheme gives rise to fractal-like structures. Furthermore, the resulting subdivided domain admits to certain weaving patterns. These patterns are subsequently generalized to several other subdivision schemes. As a final contribution, we provide paper models illustrating the weaving patterns induced by the pentagonal subdivision scheme. Furthermore, we present a jigsaw puzzle illustrating both the subdivision process and the induced weaving pattern. These transform the visual and abstract mathematical algorithms into tactile objects that offer exploration possibilities aside from the visual., Comment: Submitted for publication to the Journal of Mathematics and the Arts (2022)

Dividing a sphere uniformly into equal-area or equilateral spherical polygons is useful for a wide variety of practical applications. However, achieving such a uniform subdivision of a sphere is a challenging task. This study investigates two classes of sphere subdivisions through numerical approximation: (i) dividing a sphere into spherical polygons of equal area; and (ii) dividing a sphere into spherical polygons with a single length for all edges. A computational workflow is developed that proved to be efficient on the selected case studies. First, the subdivisions are obtained based on spheres initially composed of spherical quadrangles. New vertices are allowed to be created within the initial segments to generate subcomponents. This approach offers new opportunities to control the area and edge length of generated subdivided spherical polygons through the free movement of distributed points within the initial segments without restricting the boundary points. A series of examples are presented in this work to demonstrate that the proposed approach can effectively obtain a range of equal-area or equilateral spherical quadrilateral subdivisions. It is found that creating gaps between initial subdivided segments enables the generation of equilateral spherical quadrangles. Secondly, this study examines spherical pentagonal and Goldberg polyhedral subdivisions for equal area and/or equal edge length. In the spherical pentagonal subdivision, gaps on the sphere are not required to achieve equal edge length. Besides, there is much flexibility in obtaining either the equal area or equilateral geometry in the spherical Goldberg polyhedral subdivisions. Thirdly, this study has discovered two novel Goldberg spherical subdivisions that simultaneously exhibit equal area and equal edge length.

We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology of a semi-uniform space. We then interpret this result for graphs, where we show that the Kunneth theorem holds for graphs with respect to the strong graph product. We finish by computing the Vietoris-Rips cohomology of the torus endowed with diferent semi-uniform structures., 12 pages, incorporated referee comments

The hull of a linear code is the intersection of itself with its dual code with respect to certain inner product. Both Euclidean and Hermitian hulls are of theorical and practical significance. In this paper, we construct several new classes of MDS codes via (extended) generalized Reed-Solomon (GRS) codes and determine their Euclidean or Hermitian hulls. Specifically, four new classes of MDS codes with Hermitian hulls of flexible dimensions and six new classes of MDS codes with Euclidean hulls of flexible dimensions are constructed. For the former, we further construct four new classes of entanglement-assisted quantum error-correcting codes (EAQECCs) and four new classes of MDS EAQECCs of length $n>q+1$. For the latter, we also give some examples on Euclidean self-orthogonal and one-dimensional Euclidean hull MDS codes., 25 pages, 5 tables

We study the polygons defining the dominance order on $\mathbf{g}$-vectors in cluster algebras of rank 2., Comment: 14 pages, 3 figures. v2: added missing reference, clarified statement of theorem 1.2, minor cosmetic changes to figures; v1: initial version

We study a new discretization of the Gaussian curvature for polyhedral surfaces. This discrete Gaussian curvature is defined on each conical singularity of a polyhedral surface as the quotient of the angle defect and the area of the Voronoi cell corresponding to the singularity. We divide polyhedral surfaces into discrete conformal classes using a generalization of discrete conformal equivalence pioneered by Feng Luo. We subsequently show that, in every discrete conformal class, there exists a polyhedral surface with constant discrete Gaussian curvature. We also provide explicit examples to demonstrate that this surface is in general not unique., Comment: 31 pages, 11 figures, submitted to the Journal of Discrete and Computational Geometry

We study valuated matroids, their tropical incidence relations, flag matroids and total positivity. This leads to a characterization of permutahedral subdivisions, namely subdivisions of regular permutahedra into generalized permutahedra. Further, we get a characterization of those subdivisions arising from positive valuated flag matroids., Comment: long version of extended abstract (FPSAC 2022, DMD 2022)

A cover for a family $${{\mathcal {F}}}$$ F of sets in the plane is a set into which every set in $${{\mathcal {F}}}$$ F can be isometrically moved. We are interested in the convex cover of smallest area for a given family of triangles. Park and Cheong conjectured that any family of triangles of bounded diameter has a smallest convex cover that is itself a triangle. The conjecture is equivalent to the claim that for every convex set $${{\mathcal {X}}}$$ X there is a triangle Z whose area is not larger than the area of $${{\mathcal {X}}}$$ X , such that Z covers the family of triangles contained in $${{\mathcal {X}}}$$ X . We prove this claim for the case where a diameter of $${{\mathcal {X}}}$$ X lies on its boundary. We also give a complete characterization of the smallest convex cover for the family of triangles contained in a half-disk, and for the family of triangles contained in a square. In both cases, this cover is a triangle.

In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic planar graphs into their 3-connected components, the metric structure of a random cubic planar graph is shown to be well approximated by its unique 3-connected component of linear size, with modified distances. Then, Whitney's theorem ensures that a 3-connected cubic planar graph is the dual of a simple triangulation, for which it is known that the scaling limit is the Brownian sphere. Curien and Le Gall have recently developed a framework to study the modification of distances in general triangulations and in their dual. By extending this framework to simple triangulations, it is shown that 3-connected cubic planar graphs with modified distances converge jointly with their dual triangulation to the Brownian sphere., 58 pages

This paper investigates the propreties of the persistence diagrams stemming from almost surely continuous random processes on $[0,t]$. We focus our study on two variables which together characterize the barcode : the number of points of the persistence diagram inside a rectangle $]\!-\!\infty,x]\times [x+\varepsilon,\infty[$, $N^{x,x+\varepsilon}$ and the number of bars of length $\geq \varepsilon$, $N^\varepsilon$. For processes with the strong Markov property, we show both of these variables admit a moment generating function and in particular moments of every order. Switching our attention to semimartingales, we show the asymptotic behaviour of $N^\varepsilon$ and $N^{x,x+\varepsilon}$ as $\varepsilon \to 0$ and of $N^\varepsilon$ as $\varepsilon \to \infty$. Finally, we study the repercussions of the classical stability theorem of barcodes and illustrate our results with some examples, most notably Brownian motion and empirical functions converging to the Brownian bridge., 20 pages

We prove asymptotic formulas for the expectation of the vertex number and missed area of uniform random disc-polygons in convex disc-polygons. Our statements are the $r$-convex analogues of the classical results of R\'enyi and Sulanke (1964) about random polygons in convex polygons.

We define a new cutting plane closure for pure integer programs called the two-halfspace closure. It is a natural generalization of the well-known Chv\'atal-Gomory closure. We prove that the two-halfspace closure is polyhedral. We also study the corresponding $2$-halfpsace rank of any valid inequality and show that it is at most the split rank of the inequality. Moreover, while the split rank can be strictly larger than the two-halfspace rank, the split rank is at most twice the two-halfspace rank. A key step of our analysis shows that the split closure of a rational polyhedron can be obtained by considering the split closures of all $k$-dimensional (rational) projections of the polyhedron, for any fixed $k\geq 2$. This result may be of independent interest.

We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain classes of additive arithmetic functions. In particular, we consider the generalized omega function $\Omega_{\ell}(n)= \sum_{p^\nu \mid\mid n} \nu^{\ell}$ investigated by Duncan (1962) and Hassani (2018), and the functions $A(n)=\sum_{p^\nu \mid\mid n} \nu p$, $A^*(n)= \sum_{p \mid n} p$, $B(n)=A(n)-A^*(n)$ studied by Alladi and Erd\H{o}s (1977). As a key auxiliary result we use an inclusion-exclusion-type identity., Comment: 22 pages

This paper investigates the accurate modeling issue for a class of origami-type dynamic systems with simultaneous kinematical restraint, multi-parameter coupling, and geometric nonlinearity. Based on the geometric relationship, the vertical displacement is transformed into the main variable to characterize the motion of the origami system, and the auxetic property is demonstrated. By using equivalent principle and rigid-foldable origami theory, the negative stiffness is obtained and its formation mechanism is revealed. The accurate dynamic model with consideration of stiffness and damping nonlinearities induced by the periodically nonlinear arrangement is established via Lagrange equation. Then, the origami mechanism is employed in the vibration isolation system to realize quasi-zero-stiffness (QZS) characteristic, and the dynamic behaviors of origami-type isolator subjected to base excitation and force excitation are conducted. A series of simulation studies are provided to validate the superior isolation performance of the designed isolator and the positive effect of the geometric nonlinearity. The proposed accurate modeling framework can be extended to other origami mechanisms and their applications, which can provide powerful theoretical support to the development of origami.

The first goal of the present paper is to study the class groups of the edge rings of complete multipartite graphs, denoted by $\Bbbk[K_{r_1,\ldots,r_n}]$, where $1 \leq r_1 \leq \cdots \leq r_n$. More concretely, we prove that the class group of $\Bbbk[K_{r_1,\ldots,r_n}]$ is isomorphic to $\mathbb{Z}^n$ if $n =3$ with $r_1 \geq 2$ or $n \geq 4$, while it turns out that the excluded cases can be deduced into Hibi rings. The second goal is to investigate the special class of divisorial ideals of $\Bbbk[K_{r_1,\ldots,r_n}]$, called conic divisorial ideals. We describe conic divisorial ideals for certain $K_{r_1,\ldots,r_n}$ including all cases where $\Bbbk[K_{r_1,\ldots,r_n}]$ is Gorenstein. Finally, we give a non-commutative crepant resolution (NCCR) of $\Bbbk[K_{r_1,\ldots,r_n}]$ in the case where it is Gorenstein., 21 pages