相关论文: Degree bound for toric envelope of a linear algebr…

Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…

We describe a new algorithm for calculating the topological degree deg (f, B, 0) where B \subseteq Rn is a product of closed real intervals and f : B \rightarrow Rn is a real-valued continuous function given in the form of arithmetical…

This work studies discontinuous Galerkin (DG) approximations of the boundary value problem for homogeneous transversely isotropic linear elastic bodies. Low-order approximations on triangles are adopted, with the use of three interior…

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

We provide a new condition for an absolutely almost simple algebraic group to have good reduction with respect to a discrete valuation of the base field which is formulated in terms of the existence of maximal tori with special properties.…

We define a class of quantum linear Galois algebras which include the universal enveloping algebra Uq(gln), the quantum Heisenberg Lie algebra and other quantum orthogonal Gelfand-Zetlin algebras of type A, the subalgebras of G-invariants…

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.

We prove for each integer $\ell\geq 1$ an unconditional upper bound for the size of the $\ell$-torsion subgroup $Cl_K[\ell]$ of the class group of $K$, which holds for all but a zero density set of number fields $K$ of degree $d\in\{4,5\}$…

We show the boundedness of finite subgroups in any anisotropic reductive algebraic group over a perfect field that contains all roots of 1. Also, we provide explicit bounds for orders of finite subgroups of automorphism groups of…

In the graph label selection problem, one is given an $n$-vertex graph and a budget $k$, and seeks to select $k$ vertices whose labels enable accurate prediction of the labels on the remaining vertices. This problem formalizes distilling a…

Linckelmann showed in 2011 that a group algebra is separably equivalent to the group algebra of its Sylow p-subgroups. In this article we use this relationship, together with Mackey decomposition, to demonstrate that a group algebra of a…

In this paper, we refer to a asymptotic degree sequence as $\mathscr{D}=(d_1,d_2,\dots,d_n)$. The examination of topological indices on trees gives us a general overview through bounds to find the maximum and minimum bounds which reflect…

The Tensor Isomorphism problem (TI) has recently emerged as having connections to multiple areas of research within complexity and beyond, but the current best upper bound is essentially the brute force algorithm. Being an algebraic…

The last five years of research on distributed graph algorithms have seen huge leaps of progress, both regarding algorithmic improvements and impossibility results: new strong lower bounds have emerged for many central problems and…

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

We establish the first effective improvements on the Liouville inequality for approximation to complex non-real algebraic numbers by complex algebraic numbers of degree at most 4.

We describe relations between maximal subfields in a division ring and in its rational extensions. More precisely, we prove that properties such as being Galois or purely inseparable over the centre generically carry over from one to…

We present a strategy for proving an asymptotic upper bound on the number of defects (non-hexagonal Voronoi cells) in the $n$ generator optimal quantizer on a closed surface (i.e., compact 2-manifold without boundary). The program is based…

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…