arXiv subjects

Lucas Kang

Publications and source records attributed to Lucas Kang.

5 recordsLinked to original sources

arXiv2026

Maximizing Returns: Optimizing Experimental Observables at the LHC

We introduce a framework that integrates both analytical and machine-learning approaches for calculating observables optimal for EFT and broader applications at the LHC. A new metric for evaluating the performance of these approaches has been introduced. In addition, we demonstrate how the majority of relevant information can be effectively stored in a limited number of bins, allowing for efficient data analysis, data preservation, and global data combination, while also providing tools to achieve these benefits. A key feature of this approach is the reduction in the dimensionality of the observable information, which enhances both the effectiveness and practicality of the data analysis while maximizing gains within limited resources. These features have been demonstrated through simulated analyses of the Higgs boson production and decay processes at the LHC.

hep-ph↗

arXiv2022

Off-shell Higgs Interpretations Task Force: Models and Effective Field Theories Subgroup Report

This report presents the results of the Models and Effective Field Theories Subgroup of the Off-Shell Interpretations Task Force in the LHC Higgs Working Group. The main goal of the subgroup was to discuss and advance the potential impact of off-shell Higgs measurements on searches for BSM physics carried out in the EFT framework or as benchmark model studies. In the first contribution, the off-shell potential to resolve flat directions in parameter space for on-shell measurements is studied. Furthermore, the sensitivity of off-shell measurements to SMEFT dimension-6 operators for the gg $\to$ ZZ process is discussed, and studies of explicit models that are testable in off-shell production are reviewed. In the second contribution, the SMEFT effects in the off-shell gluon fusion and electroweak processes are discussed. Subsequently, the computation of integrated and differential effects using SMEFT@NLO and MG5_aMC@NLO, or JHUGen and MCFM, is demonstrated. On that basis, a study of the prospects of obtaining additional SMEFT constraints - beyond those from existing global fits - by utilising the off-shell process is presented. For clarification, a revised introduction, definition and discussion of the Higgs basis parametrisation of the SMEFT is given in the third contribution. In short notes on the SMEFT, the Higgs basis with an additional constraint is discussed and relations between the Higgs and Warsaw bases are presented. Lastly, an overview of EFT calculations and tools is given.

hep-ph↗

arXiv2019

Generating all 36,864 Four-Color Adinkras via Signed Permutations and Organizing into $\ell$- and $\tilde{\ell}$-Equivalence Classes

Recently, all 1,358,954,496 values of the gadget between the 36,864 adinkras with four colors, four bosons, and four fermions have been computed. In this paper, we further analyze these results in terms of $BC_3$, the signed permutation group of three elements, and $BC_4$, the signed permutation group of four elements. It is shown how all 36,864 adinkras can be generated via $BC_4$ boson $\times$ $BC_3$ color transformations of two quaternion adinkras that satisfy the quaternion algebra. An adinkra inner product has been used for some time, known as the \emph{gadget}, which is used to distinguish adinkras. We~show how 96 equivalence classes of adinkras that are based on the gadget emerge in terms of $BC_3$ and $BC_4$. We also comment on the importance of the gadget as it relates to separating out dynamics in terms of Kähler-like potentials. Thus, on the basis of the complete analysis of the supersymmetrical representations achieved in the preparatory first four sections, the final comprehensive achievement of this work is the construction of the universal $BC_4$ non-linear $σ$-model.

hep-th↗

arXiv2018

Adinkras From Ordered Quartets of BC4 Coxeter Group Elements and Regarding Another Gadget's 1,358,954,496 Matrix Elements

A Gadget, more precisely a scalar Gadget, is defined as a mathematical calculation acting over a domain of one or more adinkra graphs and whose range is a real number. A 2010 work on the subject of automorphisms of adinkra graphs, implied the existence of multiple numbers of Gadgets depending on the number of colors under consideration. For four colors, this number is two. In this work, we verify the existence of a second such Gadget and calculate (both analytically and via explicit computer-enabled algorithms) its 1,358,954,496 matrix elements over 36,864 minimal valise adinkras related to the Coxeter Group BC4.

hep-th↗

arXiv2013

Investigation of Rule 73 as Case Study of Class 4 Long-Distance Cellular Automata

Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been studied in particular due to its simple form and versatility. However, these dynamic computation systems possess evolutionary rules dependent on a neighborhood of adjacent cells, which limits their sampling radius and the environments that they can be used in. The purpose of this study was to explore the complex nature of one-dimensional CA in configurations other than that of the standard ECA. Namely, "long-distance cellular automata" (LDCA), a construct that had been described in the past, but never studied. I experimented with a class of LDCA that used spaced sample cells unlike ECA, and were described by the notation LDCA-x-y-n, where x and y represented the amount of spacing between the cell and its left and right neighbors, and n denoted the length of the initial tape for tapes of finite size. Some basic characteristics of ECA are explored in this paper, such as seemingly universal behavior, the prevalence of complexity with varying neighborhoods, and qualitative behavior as a function of x and y spacing. Focusing mainly on purely Class 4 behavior in LDCA-1-2, I found that Rule 73 could potentially be Turing universal through the emulation of a cyclic tag system, and revealed a connection between the mathematics of binary trees and Eulerian numbers that might provide insight into unsolved problems in both fields.

nlin.CG↗