Related papers: Degree bound for toric envelope of a linear algebr…

We investigate the behavior of the higher-order degrees, db_n, of a finitely presented group G. These db_n are functions from H^1(G;Z) to Z whose values are the degrees certain higher-order Alexander polynomials. We show that if def(G) is…

In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…

Preliminary group classification became prominent as an approach to symmetry analysis of differential equations due to the paper by Ibragimov, Torrisi and Valenti [J. Math. Phys. 32, 2988-2995] in which partial preliminary group…

The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…

For every connected, almost simple linear algebraic group $G\leq\mathrm{GL}_{n}$ over a large enough field $K$, every subvariety $V\subseteq G$, and every finite generating set $A\subseteq G(K)$, we prove a general dimensional bound, that…

We compute the fundamental group of the Galois cover of a surface of degree~$8$, with singularities of degree $4$, whose degeneration envelope is isomorphic to an octahedron. The group is shown to be a metabelian group of order $2^{23}$.…

The paper is concerned with the following version of Hilbert's irreducibility theorem: if $\pi: X \to Y$ is a Galois $G$-covering of varieties over a number field $k$ and $H \subset G$ is a subgroup, then for all sufficiently large and…

Characteristic imsets are 0-1 vectors which correspond to Markov equivalence classes of directed acyclic graphs. The study of their convex hull, named the characteristic imset polytope, has led to new and interesting geometric perspectives…

We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization of bipartite $b$-matching. In the group-realizable setting,…

We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

Using Mazur's theorem on torsions of elliptic curves, an upper bound 24 for the order of the finite Galois group $\mathcal{H}$ associated with weighted walks in the quarter plane $\mathbb{Z}^2_+$ is obtained. The explicit criterion for…

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…

Let $\ell\geq 5$ be a prime number and $\mathbb{F}_\ell$ denote the finite field with $\ell$ elements. We show that the number of Galois extensions of the rationals with Galois group isomorphic to $GL_2(\mathbb{F}_\ell)$ and absolute…

This article focuses on the study of toric algebraic statistical models which correspond to toric Del Pezzo surfaces with Du Val singularities. A closed-form for the Maximum Likelihood Estimate of algebraic statistical models which…

A $(2,1)$-total labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ and the edge set $E(G)$ to the set $\{0,1,...,k\}$ of nonnegative integers such that $|f(x)-f(y)|\ge 2$ if $x$ is a vertex and $y$ is an edge incident…

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…

Let $G$ be a simple algebraic group of exceptional type over an algebraically closed field of characteristic $p \geqslant 0$ which is not algebraic over a finite field. Let $\mathcal{C}_1, \ldots, \mathcal{C}_t$ be non-central conjugacy…