Algorithmic boundedness-from-below conditions for generic scalar potentials
Abstract Checking that a scalar potential is bounded from below (BFB) is an ubiquitous and notoriously difficult task in many models with extended scalar sectors. Exact analytic BFB conditions are known only in simple cases. In this work, we present a novel approach to algorithmically establish the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-05-01
|
| Series: | European Physical Journal C: Particles and Fields |
| Online Access: | http://link.springer.com/article/10.1140/epjc/s10052-018-5893-y |