Related papers: The Largest Possible Finite Degree of Functions be…

Given a connected real Lie group and a contractible homogeneous proper $G$--space $X$ furnished with a $G$--invariant volume form, a real valued volume can be assigned to any representation $\rho\colon \pi_1(M)\to G$ for any oriented closed…

We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…

For R(z, w) rational with complex coefficients, of degree at least 2 in w, we show that the number of rational functions f(z) solving the difference equation f(z+1)=R(z, f(z)) is finite and bounded just in terms of the degrees of R in the…

Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

We obtain a complete classification of all finite-dimensional irreducible modules over classical map superalgebras, provide formulas for their (super)characters and a description of their extension groups. Furthermore, we describe the block…

In this paper we investigate multifractal decompositions based on values of Birkhoff averages of functions from a class of symbolically continuous functions. This will be done for an expanding interval map with infinitely many branches and…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

Let $A\subset B$ be an integral ring extension of integral domains with fields of fractions $K$ and $L$, respectively. The integral degree of $A\subset B$, denoted by ${\rm d}_A(B)$, is defined as the supremum of the degrees of minimal…

Multi-valued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the moniker search problems leading to complexity classes such as PPAD and PLS…

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…

In the first part of this paper we establish, in terms of so called k-tangential sets, a kind of optimal estimate for the size and structure of the set of non-differentiability of Lipshitz functions with one-sided directional derivatives.…

A rational function of degree at least two with coefficients in an algebraically closed field is post-critically finite (PCF) if all of its critical points have finite forward orbit under iteration. We show that the collection of PCF…

Noncommutative functions are graded functions between sets of square matrices of all sizes over two vector spaces that respect direct sums and similarities. They possess very strong regularity properties (reminiscent of the regularity…

We study projective completions of affine algebraic varieties which are given by filtrations, or equivalently, 'degree like functions' on their rings of regular functions. For a quasifinite polynomial map P (i.e. with all fibers finite) of…

Let $G$ be a finite group. If $M_n < M_{n-1} < \ldots < M_1 < M_{0}=G $ where $M_i$ is a maximal subgroup of $M_{i-1}$ for all $i=1, \ldots ,n$, then $M_n $ ($n > 0$) is an \emph{$n$-maximal subgroup} of $G$. A subgroup $M$ of $G$ is called…

We develop the theory of transfer and norm maps for finite group schemes, extending classical results from finite group theory to a context where induction and restriction are not necessarily bi-adjoint. In the additive setting, we…

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…