1.5k citations
- Centre National de la Recherche ScientifiqueFR17 papers
- Space Telescope Science InstituteUS14 papers
- California Institute of TechnologyUS11 papers
- Leiden UniversityNL11 papers
- Max Planck Institute for AstronomyDE11 papers
- University of MichiganUS11 papers
- George Washington UniversityUS10 papers
- The University of Texas at AustinUS10 papers
- Université Bourgogne Franche-ComtéFR10 papers
- University of ArizonaUS10 papers
- University of HoustonUS9 papers
- Center for Astrophysics Harvard & SmithsonianUS8 papers
8 papers · 1 filter
Power propagation time and lower bounds for power domination number
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter +1
We present a counterexample to a lower bound for the power domination number given in Liao, Power domination with bounded time constraints, J. Comb. Optim. 31 (2016)725-742. We als…
A Weak Galerkin Finite Element Method for A Type of Fourth Order Problem Arising From Fluorescence Tomography
Chunmei Wang, Haomin Zhou
In this paper, a new and efficient numerical algorithm by using weak Galerkin (WG) finite element methods is proposed for a type of fourth order problem arising from fluorescence t…
Computing Quasidegrees of A-graded Modules
Roberto Barrera
We describe the main functions of the Macaulay2 package Quasidegrees. The purpose of this package is to compute the quasidegree set of a finitely generated A-graded module presente…
Discrete Envy-free Division of Necklaces and Maps
Roberto Barrera, Kathryn Nyman, Amanda Ruiz +2
We study the discrete variation of the classical cake-cutting problem where n players divide a 1-dimensional cake with exactly (n-1) cuts, replacing the continuous, infinitely divi…
Limit Models in Strictly Stable Abstract Elementary Classes
Will Boney, Monica M. VanDieren
In this paper, we examine the locality condition for non-splitting and determine the level of uniqueness of limit models that can be recovered in some stable, but not superstable,…
Lower Bounds on the Distance Domination Number of a Graph
Randy Davila, Caleb Fast, Michael Henning +1
For an integer , a (distance) -dominating set of a connected graph is a set of vertices of such that every vertex of is at distance at mo…