An official website of the United States government
Predictive modeling in physical science and engineering is mostly based on solving certain partial differential equations where the complexity of solutions is dictated by the geometry of the domain. Motivated by the broad applications of explicit solutions for spherical and ellipsoidal domains, in particular, the Eshelby’s solution in elasticity, we propose a generalization of ellipsoidal shapes called polynomial inclusions. A polynomial inclusion (or -inclusion for brevity) of degree is defined as a smooth, connected and bounded body whose Newtonian potential is a polynomial of degree inside the body. From this viewpoint, ellipsoids are identified as the only -inclusions of degree two; many fundamental problems in various physical settings admit simple closed-form solutions for general -inclusions as for ellipsoids. Therefore, we anticipate that -inclusions will be useful for applications including predictive materials models, optimal designs, and inverse problems. However, the existence of p-inclusions beyond degree two is not obvious, not to mention their explicit algebraic parameterizations. In this work, we explore alternative definitions and properties of p-inclusions in the context of potential theory. Based on the theory of variational inequalities, we show that -inclusions do exist for certain polynomials, though a complete characterization remains open. We reformulate the determination of surfaces of -inclusions as nonlocal geometric flows which are convenient for numerical simulations and studying geometric properties of -inclusions. In two dimensions, by the method of conformal mapping we find an explicit algebraic parameterization of p-inclusions. We also propose a few open problems whose solution will deepen our understanding of relations between domain geometry, Newtonian potentials, and solutions to general partial differential equations. We conclude by presenting examples of applications of -inclusions in the context of Eshelby inclusion problems and magnet designs.
more »
« less
Triangulations of simplices with vanishing local h-polynomial
Motivated by connections to intersection homology of toric morphisms, the motivic monodromy conjecture, and a question of Stanley, we study the structure of geometric trian- gulations of simplices whose local h-polynomial vanishes. As a first step, we identify a class of refinements that preserve the local h-polynomial. In dimensions 2 and 3, we show that all geometric triangulations with vanishing local h-polynomial are obtained from one or two simple examples by a sequence of such refinements. In higher dimensions, we prove some partial results and give further examples.
more »
« less
- Award ID(s):
- 2001502
- PAR ID:
- 10250317
- Date Published:
- Journal Name:
- Algebraic combinatorics
- Volume:
- 3
- Issue:
- 6
- ISSN:
- 2589-5486
- Page Range / eLocation ID:
- 1417-1430
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This work studies three multigrid variants for matrix-free finite-element computations on locally refined meshes: geometric local smoothing, geometric global coarsening (both h -multigrid), and polynomial global coarsening (a variant of p -multigrid). We have integrated the algorithms into the same framework—the open source finite-element library deal.II —, which allows us to make fair comparisons regarding their implementation complexity, computational efficiency, and parallel scalability as well as to compare the measurements with theoretically derived performance metrics. Serial simulations and parallel weak and strong scaling on up to 147,456 CPU cores on 3,072 compute nodes are presented. The results obtained indicate that global-coarsening algorithms show a better parallel behavior for comparable smoothers due to the better load balance, particularly on the expensive fine levels. In the serial case, the costs of applying hanging-node constraints might be significant, leading to advantages of local smoothing, even though the number of solver iterations needed is slightly higher. When using p - and h -multigrid in sequence ( hp -multigrid), the results indicate that it makes sense to decrease the degree of the elements first from a performance point of view due to the cheaper transfer.more » « less
-
A<sc>bstract</sc> In this work we study interesting corners of the quantum gravity landscape with 8 supercharges pushing the boundaries of our current understanding. Calabi-Yau threefolds compactifications of F/M/type II theories to 6, 5 and 4 dimensions are the most prominent examples of this class, and these always lead to a universal hypermultiplet coming from the volume/string coupling constant. We find new examples of asymmetric orbifold constructions which have no hypermultiplets in 4 or 5 dimensions and no neutral hypers in 6d. We argue that these theories can also be obtained by going to strong coupling/small volume regions of geometric constructions where a new Coulomb branch opens up and moving in this direction freezes the volume/string coupling constant. Interestingly we find that the Kodaira condition encountered in geometric limits of F-theory compactifications to 6 dimensions is violated in these corners of the landscape due to strong quantum corrections. We also construct a theory in 3 dimensions which if it were to arise by toroidal compactifications from 5d, it would have to come from pure$$ \mathcal{N} $$ = 1 supergravity with no massless scalar fields.more » « less
-
Robust estimation is much more challenging in high-dimensions than it is in one-dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in theoretical computer science has shown that, in appropriate distributional models, it is possible to robustly estimate the mean and covariance with polynomial time algorithms that can tolerate a constant fraction of corruptions, independent of the dimension. However, the sample and time complexity of these algorithms is prohibitively large for high-dimensional applications. In this work, we address both of these issues by establishing sample complexity bounds that are optimal, up to logarithmic factors, as well as giving various refinements that allow the algorithms to tolerate a much larger fraction of corruptions. Finally, we show on both synthetic and real data that our algorithms have state-of-the-art performance and suddenly make high-dimensional robust estimation a realistic possibility.more » « less
-
Abstract We construct and analyse finite element approximations of the Einstein tensor in dimension $$N \ge 3$$. We focus on the setting where a smooth Riemannian metric tensor $$g$$ on a polyhedral domain $$\varOmega \subset \mathbb{R}^{N}$$ has been approximated by a piecewise polynomial metric $$g_{h}$$ on a simplicial triangulation $$\mathcal{T}$$ of $$\varOmega $$ having maximum element diameter $$h$$. We assume that $$g_{h}$$ possesses single-valued tangential–tangential components on every codimension-$$1$$ simplex in $$\mathcal{T}$$. Such a metric is not classically differentiable in general, but it turns out that one can still attribute meaning to its Einstein curvature in a distributional sense. We study the convergence of the distributional Einstein curvature of $$g_{h}$$ to the Einstein curvature of $$g$$ under refinement of the triangulation. We show that in the $$H^{-2}(\varOmega )$$-norm this convergence takes place at a rate of $$O(h^{r+1})$$ when $$g_{h}$$ is an optimal-order interpolant of $$g$$ that is piecewise polynomial of degree $$r \ge 1$$. We provide numerical evidence to support this claim. In the process of proving our convergence results we derive a few formulas for the evolution of certain geometric quantities under deformations of the metric.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.5802/alco
