Related papers: Combinatorial transfer: a new method for construct…
We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in the momenta, for…
Incremental learning with concept drift has often been tackled by ensemble methods, where models built in the past can be re-trained to attain new models for the current data. Two design questions need to be addressed in developing ensemble…
We reduce the computation of Poisson traces on quotients of symplectic vector spaces by finite subgroups of symplectic automorphisms to a finite one, by proving several results which bound the degrees of such traces as well as the dimension…
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
In this paper, we initiate the study of nondiagonal finite quasi-quantum groups over finite abelian groups. We mainly study the Nichols algebras in the twisted Yetter-Drinfeld module category $_{\k G}^{\k G}\mathcal{YD}^\Phi$ with $\Phi$ a…
Initially motivated by Hrushovski's paper on definability patterns, we obtain homeomorphisms between Ellis semigroups related to natural actions of the automorphism groups of first order structures and certain collections of types and…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
We generalize the framework of spurion analysis to a class of selection rules arising from non-invertible fusion algebras in perturbation theory. As a first step toward systematic applications to particle physics, we analyze the near-group…
The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…
We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…
This work aims to bridge the gap between Dunkl superintegrable systems and the coalgebra symmetry approach to superintegrability, and subsequently to recover known models and construct new ones. In particular, an infinite family of…
The defining characteristic of an exceptional point (EP) in the parameter space of a family of operators is that upon encircling the EP eigenstates are permuted. In case one encircles multiple EPs, the question arises how to properly…
We construct continuum many infinite, simple, characteristic quotients of non-abelian free groups, answering a 1978 question of James Wiegold. The method is very flexible, allowing to impose certain properties on the quotients, to…
Diestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call this structural submodularity. Williamson, Goemans, Mihail,…
We use the language of categorical condensation to give a procedure for gauging nonabelian anyons, which are the manifestations of categorical symmetries in three spacetime dimensions. We also describe how the condensation procedure can be…
Multi-Higgs models equipped with global symmetry groups, either exact or softly broken, offer a rich framework for constructions beyond the Standard Model and lead to remarkable phenomenological consequences. Knowing all the symmetry…
Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain…
Deep clustering, which learns representation and semantic clustering without labels information, poses a great challenge for deep learning-based approaches. Despite significant progress in recent years, most existing methods focus on…
We build quasi--isometry invariants of relatively hyperbolic groups which detect the hyperbolic parts of the group; these are variations of the stable dimension constructions previously introduced by the authors. We prove that, given any…
In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an…