In order to enable an iCal export link, your account needs to have an API key created. This key enables other applications to access data from within Indico even when you are neither using nor logged into the Indico system yourself with the link provided. Once created, you can manage your key at any time by going to 'My Profile' and looking under the tab entitled 'HTTP API'. Further information about HTTP API keys can be found in the Indico documentation.
Additionally to having an API key associated with your account, exporting private event information requires the usage of a persistent signature. This enables API URLs which do not expire after a few minutes so while the setting is active, anyone in possession of the link provided can access the information. Due to this, it is extremely important that you keep these links private and for your use only. If you think someone else may have acquired access to a link using this key in the future, you must immediately create a new key pair on the 'My Profile' page under the 'HTTP API' and update the iCalendar links afterwards.
Permanent link for public information only:
Permanent link for all public and protected information:
The 15th meeting of the MCnet network is also the kick-off meeting of the MCnetITN3 consortium, funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 722104.
Automating Basis Reduction for Effective Lagrangians in FeynRules30m
Accounting for redundancies among higher-dimensional operators is necessary in any Effective Field Theory, and has historically been a source of confusion in its applications to the Standard Model. Even while the procedure is now well-understood, reducing an arbitrary set of operators onto an agreed basis is still a time-consuming step arising in matching a given UV completion to an EFT, and at each order in perturbation theory where this plays a key role in renormalizing the theory.
Emulating the procedure used to derive the `Warsaw' basis of the dimension-six SMEFT, work to automate this reduction will be discussed using FeynRules, with the aim of providing a tool which will be useful in SMEFT calculations and lend itself to future generalization, e.g. to the construction of operator bases for theories beyond the SM, and eliminating redundancies in operators of still higher mass dimension.
Liam Ronald Moore
(University of Glasgow (GB))
We introduce a new jet substructure method based on a recursive
iteration of the Soft Drop algorithm. The recursive soft drop
algorithm introduces an additional parameter N to define the
number of layers of soft drop declustering, providing an
optimized grooming strategy for boosted objects with (N+1)-prong
decays, as well as improved stability in high pileup
conditions. We discuss the infinite N limit, where groomed jets
have a null area, and investigate their properties. We show
promising applications to jet mass resolution in boosted top and
W bosons, and demonstrate how recursive soft drop grooming can
substantially mitigate pileup effects when used in conjunction
with existing pileup-removal methods.