Related papers: A geometric framework for the subfield problem of …
Generalized parallelizable spaces allow a unified treatment of consistent maximally supersymmetric truncations of ten- and eleven-dimensional supergravity in generalized geometry. Known examples are spheres, twisted tori and hyperboloides.…
The Modular Isomorphism Problem asks, if an isomorphism between modular group algebras of finite $p$-groups over a field $F$ implies an isomorphism of the group bases. We explore the differences of knowledge on the problem when $F$ is…
We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…
We introduce a Grothendieck group $E_n$ for bounded polytopes in $\mathbb R^n$. It differs from the usual Euclidean scissors congruence group in that lower-dimensional polytopes are not ignored. We also define an analogous group $L_n$ using…
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
We create several families of bases for the symmetric polynomials. From these bases we prove that certain Schur symmetric polynomials form a basis for quotients of symmetric polynomials that generalize the cohomology and the quantum…
The methods of classical invariant theory are used to construct generic polynomials for groups $S_5$ and $A_5$, along with explicit reductions to specializations of the generic polynomials defining any desired field extension with those…
Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
It was recently argued that quantum field theories possess one-form and higher-form symmetries, labelled `generalized global symmetries.' In this paper, we describe how those higher-form symmetries can be understood mathematically as…
Heisenberg groups over algebras with central involution and their automorphism groups are constructed. The complex quaternion group algebra over a prime field is used as an example. Its subspaces provide finite models for each of the real…
For vectors in $\mathbb{E}_3$ we introduce an associative, commutative and distributive multiplication. We describe the related algebraic and geometrical properties, and hint some applications. Based on properties of hyperbolic (Clifford)…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…
We set up the bootstrap procedure for supersymmetric Galilean Conformal (SGC) field theories in two dimensions by constructing the SGC blocks in the $\mathcal{N}=1$ and two possible $\mathcal{N} =2$ extensions of the Galilean conformal…
We resolve the Grothendieck-Serre question over an arbitrary base field $k$: for a smooth $k$-group scheme $G$ and a smooth $k$-variety $X$, we show that every generically trivial $G$-torsor over $X$ trivializes Zariski semilocally on $X$.…
Classification theorems for linear differential equations in two real variables, possessing eigenfunctions in the form of the polynomials (the generalized Bochner problem) are given. The main result is based on the consideration of the…
It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…
In this work we explicitly construct polynomial vector fields $\mathcal{L}_k,\;k=0,1,2,3,4,6$ on the complex linear space $\mathbb{C}^6$ with coordinates $X=(x_2,x_3,x_4)$ and $Z=(z_4,z_5,z_6)$. The fields $\mathcal{L}_k$ are linearly…
After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…