An official website of the United States government
Abstract We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound (the conductor). For many numerical semigroups, including all symmetric numerical semigroups, our upper bound is tight. Our construction uses combinatorially structured matrices and is parametrised by Kunz coordinates, which are central to enumerative problems in the study of numerical semigroups.
more »
« less
This content will become publicly available on February 28, 2026
Polygonal symplectic billiards
In this article, we study polygonal symplectic billiards. We provide new results, some of which are inspired by numerical investigations. In particular, we present several polygons for which all orbits are periodic. We demonstrate their properties and derive various conjectures using two numerical implementations.
more »
« less
- Award ID(s):
- 2005444
- PAR ID:
- 10588148
- Publisher / Repository:
- AMR
- Date Published:
- Journal Name:
- Journal of the Association for Mathematical Research
- Volume:
- 1
- Issue:
- 1
- ISSN:
- 2998-4114
- Page Range / eLocation ID:
- 1 to 22
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We prove the well‐posedness and smoothing properties of a distributed‐order time‐fractional diffusion equation with a singular density function in multiple space dimensions, which could model the ultraslow subdiffusion processes. We accordingly derive a finite element approximation to the problem and prove its optimal‐order error estimate. Numerical results are presented to support the mathematical and numerical analysis.more » « less
-
The kernel polynomial method (KPM) is a powerful numerical method for approximating spectral densities. Typical implementations of the KPM require an a prior estimate for an interval containing the support of the target spectral density, and while such estimates can be obtained by classical techniques, this incurs addition computational costs. We propose a spectrum adaptive KPM based on the Lanczos algorithm without reorthogonalization, which allows the selection of KPM parameters to be deferred to after the expensive computation is finished. Theoretical results from numerical analysis are given to justify the suitability of the Lanczos algorithm for our approach, even in finite precision arithmetic. While conceptually simple, the paradigm of decoupling computation from approximation has a number of practical and pedagogical benefits, which we highlight with numerical examples.more » « less
-
This article develops a unified general framework for designing convergent finite difference and discontinuous Galerkin methods for approximating viscosity and regular solutions of fully nonlinear second order PDEs. Unlike the well-known monotone (finite difference) framework, the proposed new framework allows for the use of narrow stencils and unstructured grids which makes it possible to construct high order methods. The general framework is based on the concepts of consistency and g-monotonicity which are both defined in terms of various numerical derivative operators. Specific methods that satisfy the framework are constructed using numerical moments. Admissibility, stability, and convergence properties are proved,and numerical experiments are provided along with some computer implementation details. For more information see https://ejde.math.txstate.edu/conf-proc/26/f1/abstr.htmlmore » « less
