Related papers: The Structure of Root Data and Smooth Regular Embe…
This paper studies algorithms for computing a Gomory-Hu tree, which is a classical data structure that compactly stores all minimum $s$-$t$ cuts of an undirected weighted graph. We consider two classes of algorithms: the original method by…
The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the…
This expository article introduces the topic of roots in a compact Lie group. Compared to the many other treatments of this standard topic, I intended for mine to be relatively elementary, example-driven, and free of unnecessary…
Let G be a simply connected semisimple algebraic group over an algebraically closed field k of positive characteristic. We will untwist the structure of G-modules by a newly found splitting of the Frobenius endomorphism on the algebra of…
In recent times, there has been a lot of active research on monomial groups in two different directions. While group theorists are interested in the study of their normal subgroups and Hall subgroups, the interest of group ring theorists…
We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…
Let $X$ be a complex manifold and $S\hookrightarrow X$ be an embedding of complex submanifold. Assuming that the embedding is $(k-1)$-linearizable or $(k-1)$-comfortably embedded, we construct via the deformation to the normal cone a…
For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…
The approximation of a multiple isolated root is a difficult problem. In fact the root can even be a repulsive root for a fixed point method like the Newton method. However there exists a huge literature on this topic but the answers given…
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…
A theory of modules over posets is developed to define computationally feasible, topologically interpretable data structures, in terms of birth and death of homology classes, for persistent homology with multiple real parameters. To replace…
We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…
The germ of the universal isomonodromic deformation of a logarithmic connection on a stable n-pointed genus g curve always exists in the analytic category. The first part of this paper investigates under which conditions it is the analytic…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
The intention of the present study is to establish the mathematical fundamentals for automated problem solving essentially targeted for robotics by approaching the task universal algebraically introducing knowledge as realizations of…
We study the structure of generalized Baumslag-Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of…
We define the group analogue of birational sheets, a construction performed by Losev for reductive Lie algebras. For G semisimple simply connected, we describe birational sheets in terms of Lusztig-Spaltenstein induction and we prove that…
There is growing evidence that independently trained AI systems come to represent the world in the same way. In other words, independently trained embeddings from text, vision, audio, and neural signals share an underlying geometry. We call…