AMERICAN MATHEMATICAL MONTHLY美国数学月刊
AMERICAN MATHEMATICAL MONTHLY(英文缩写 AM MATH MON),ISSN 0002-9890,eISSN 1930-0972,中文译名:美国数学月刊 是一本学术期刊。本页汇总该期刊的最新影响因子、分区信息以及最新收录于 PubMed 的文献,帮助您快速了解期刊全貌。
发文量统计区间：2025-09-27 至 2026-09-27，按本站收录文献的发表日期统计。
期刊介绍
历年影响因子趋势
| JCR 数据年份 | 影响因子 | JCR 分区 |
|---|---|---|
| 2021 | 0.453 | Q4 |
| 2022 | 0.500 | Q4 |
| 2023 | 0.400 | Q4 |
| 2024 | 0.400 | Q4 |
| 2025 | 0.500 | Q3 |
AMERICAN MATHEMATICAL MONTHLY 最新收录文献
-
1. Quasirandom Graphs and the Pantograph Equation.
PMID:期刊:日期:2021-01-01The pantograph differential equation and its solution, the deformed exponential function, are remarkable objects that appear in areas as diverse as combinatorics, number theory, statistical mechanics, and electrical engineering. In this article, we describe a new surprising application of these objects in graph theory, by showing that the set of all cliques is not forcing for quasirandomness. This provides a natural example of an infinite family of graphs, which is not forcing, and answers a natural question posed by P. Horn.
-
2. Hadamard's Determinant Inequality.
PMID:期刊:日期:2014-03-01This note is devoted to a short, but elementary, proof of Hadamard's determinant inequality.
-
3. A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization.
PMID:期刊:日期:2014-02-01In a recent issue of this journal, Mordukhovich, Nam, and Salinas pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem, one is given + 1 closed convex sets in ℝ equipped with its Euclidean norm and asked to find the point in the last set such that the sum of the distances to the first sets is minimal. In later work, the authors generalize the Heron problem even further, relax its convexity assumptions, study its theoretical properties, and pursue subgradient algorithms for solving the convex case. Here, we revisit the original problem solely from the numerical perspective. By exploiting the majorization-minimization (MM) principle of computational statistics and rudimentary techniques from differential calculus, we are able to construct a very fast algorithm for solving the Euclidean version of the generalized Heron problem.