Related papers: A Reduction Algorithm for Hilbert Modular Groups
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
A short proof of the "Rigidity theorem" using the sheaf theoretic model for Hilbert modules over polynomial rings is given. The joint kernel for a large class of submodules is described. The completion $[\mathcal I]$ of a homogeneous…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
Sets of bilinear constraints are important in various machine learning models. Mathematically, they are hyperbolas in a product space. In this paper, we give a complete formula for projections onto sets of bilinear constraints or hyperbolas…
Identifying a full basis of operators to a given order is key to the generality of Effective Field Theory (EFT) and is by now a problem of known solution in terms of the Hilbert series. The present work is concerned with hidden symmetry in…
We give formulas for the Whitehead groups and the rational $K$-theory groups of the (integer group ring of the) Hilbert modular group in terms of its maximal finite subgroups.
The goal of this paper is to give an explicit formula for the l-adic cohomology of period domains over finite fields for arbitrary reductive groups. The result is a generalisation of the computation in math.AG/9907098 which treats the case…
Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…
In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a…
Let E be a division ring and G a finite group of automorphisms of E whose elements are distinct modulo inner automorphisms of E. Given a representation \rho: B-> GL(d,E) of an F-algebra B, we give necessary and sufficient conditions for…
In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…
Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
We develop a theory of Valuation Hilbert Modules and prove a version of Beurling's theorem for these. Then we apply our version of Beurling's theorem to obtain complete descriptions of the closed invariant subspaces of a number of Hilbert…
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
This paper is a detailed study of finite-dimensional modules defined on bicomplex numbers. A number of results are proved on bicomplex square matrices, linear operators, orthogonal bases, self-adjoint operators and Hilbert spaces, including…
In this paper we develop a systematic reduction procedure for determining intermediate integrals of second order hyperbolic equations so that exact solutions of the second order PDEs under interest can be obtained by solving first order…
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr\"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite…
Let $G$ be a connected reductive algebraic group defined over an algebraically closed field %$k$ of characteristic $p > 0$. Our first aim in this note is to give concise and uniform proofs for two fundamental and deep results in the context…
In 1975, Goldfeld gave an effective solution to Gauss's conjecture on the class numbers of imaginary quadratic fields. In this paper, we generalize Goldfeld's theorem to the setting of totally real number fields.