Related papers: Multiplicative dependence among iterated values of…

We consider in general terms dynamical systems with finite-dimensional, non-simply connected configuration-spaces. The fundamental group is assumed to be finite. We analyze in full detail those ambiguities in the quantization procedure that…

We prove that the isomorphism problem for group algebras reduces to group algebras over finite extensions of the prime field. In particular, the modular isomorphism problem reduces to finite modular group algebras.

We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of the general linear group on the variety of nilpotent matrices in its Lie algebra. Lie-theoretically, it is natural to wonder about the number of orbits of…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

We classify the pairs of polynomials $f,g \in \mathbb{C}[X]$ having orbits satisfying infinitely many multiplicative dependence relations, extending a result of Ghioca, Tucker and Zieve. Moreover, we show that given $f_1,\ldots, f_n$ from a…

The classical dynamics of a particle that is driven by a rapidly oscillating potential (with frequency $\omega$) is studied. The motion is separated into a slow part and a fast part that oscillates around the slow part. The motion of the…

We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…

A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

We extend recent orbit counts for finitely generated semigroups acting on $\mathbb{P}^N$ to certain infinitely generated, polarized semigroups acting on projective varieties. We then apply these results to semigroup orbits generated by some…

We show that every finite abelian group $G$ occurs as the group of rational points of an ordinary abelian variety over $\mathbb{F}_2$, $\mathbb{F}_3$ and $\mathbb{F}_5$. We produce partial results for abelian varieties over a general finite…

This work presents a general finite element formulation based on a six--field variational principle that incorporates the consistent couple stress theory. A simple, efficient and local iteration free solving procedure that covers both…

We introduce a calculus for parameter-dependent singular Green operators on the half-space $\mathbb{R}^n_+$ that combines both elements of Grubb's calculus for boundary value problems of finite regularity and techniques of Schulze's…

The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…

We introduce a systematic framework for counting and finding independent operators in effective field theories, taking into account the redundancies associated with use of the classical equations of motion and integration by parts. By…

For two countably infinite fields whose multiplicative groups are isomorphic, we examine invariant couplings between the actions that these groups induce on the additive Pontryagin duals of the fields. We show that the actions are disjoint…

We define motivic multiple polylogarithms and prove the double shuffle relations for them. We use this to study the motivic fundamental group of the multiplicative group - {N-th roots of unity} and relate it to geometry of modular…

We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…

Team semantics is the mathematical basis of modern logics of dependence and independence. In contrast to classical Tarski semantics, a formula is evaluated not for a single assignment of values to the free variables, but on a set of such…