Related papers: $\mathcal{P}$-schemes and Deterministic Polynomial…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…

It is known that a group G definable in the field of p-adic numbers is definably locally isomorphic to the group of Q_p-points of a connected algebraic group H defined over Q_p. We show that if H is commutative then G is…

A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…

Let $G$ be a simple and simply connected algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p>0$. Assume that $p$ is good for the root system of $G$ and that the covering map $G_{sc} \rightarrow G$ is separable.…

We continue our earlier study of finite dimensional definable groups in models of the the model companion of an o-minimal L-theory T expanded by a generic derivation as in [F-K]. We generalize Buium's notion of an algebraic D-group to…

A new category of algebro-geometric objects is defined. This construction is a vast generalization of existing F1-theories, as it contains the the theory of monoid schemes on the one hand and classical algebraic theory, e.g. Grothendieck…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…

Let P a locally finite partially ordered set, F a field, G a group, and I(P,F) the incidence algebra of P over F. We describe all the inequivalent elementary G-gradings on this algebra. If P is bounded, F is a infinite field of…

Let $\mathcal{C}:=\mathcal{C}(G,\omega,H,\psi)$ be a finite group scheme-theoretical category over an algebraically closed field of characteristic $p\ge 0$ as defined by the first author. For any indecomposable exact module category over…

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not the associated map of profinite completions…

Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…

The development of mathematics has been characterized by the increasing interconnectivity of seemingly separate disciplines. Such interplay has been facilitated by a massive development in formalism; category theory has provided a common…

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Let $W$ be a finite-dimensional representation of a reductive algebraic group $G$. The invariant Hilbert scheme $\mathcal{H}$ is a moduli space that classifies the $G$-stable closed subschemes $Z$ of $W$ such that the affine algebra $k[Z]$…

Let G be a Chevalley group scheme and B<=G a Borel subgroup scheme, both defined over Z. Let K be a global function field, S be a finite non-empty set of places over K, and O_S be the corresponding S-arithmetic ring. Then, the S-arithmetic…

Bivariate P-polynomial association scheme of type $(\alpha,\beta)$ are defined as a generalization of the P-polynomial association schemes. This generalization is shown to be equivalent to a set of conditions on the intersection parameters.…

Gasharov introduced the combinatorial objects known as $P$-arrays to prove $s$-positivity for the chromatic symmetric functions of incomparability graphs of (3+1)-free posets. We define a crystal, a directed colored graph with some…

We define the notion of a parahoric group scheme $\mathcal G$ over a smooth projective curve, and formulate four conjectures on the structure of the stack of $\mathcal G$-bundles, which generalize to this case well-known results on…