Related papers: Bounding the trellis state complexity of algebraic…

Let $\mathcal{X}$ be an ordinary (projective, geometrically irreducible, nonsingular) algebraic curve of genus $\mathcal{g}(\mathcal{X}) \ge 2$ defined over an algebraically closed field $\mathbb{K}$ of odd characteristic $p$. Let…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

The well known Hurwitz upper bound states that a closed Riemann surface $S$ of genus $g \geq 2$ has at most $84(g-1)$ conformal automorphisms. If $S$ has exactly $84(g-1)$ conformal automorphisms, then it is called a Hurwitz curve. The…

Let $\mathbf{S}_k$ denote a maximal torus in the complex Lie group $\mathbf{G} = \mathrm{SL}_n(\mathbb{C})/C_k$ and let $T_k$ denote a maximal torus in its compact real form $\mathrm{SU}_n(\mathbb{C})/C_k$, where $k$ divides $n$. Let $W$…

Simple, or Kleinian, singularities are classified by Dynkin diagrams of type ADE. Let g be the corresponding finite-dimensional Lie algebra, and W its Weyl group. The set of g-invariants in the basic representation of the affine Kac-Moody…

To any graph we associate a sequence of integers called the gonality sequence of the graph, consisting of the minimum degrees of divisors of increasing rank on the graph. This is a tropical analogue of the gonality sequence of an algebraic…

We propose an algebraic method for the classification of branched Galois covers of a curve $X$ focused on studying Galois ring extensions of its geometric adele ring $\A_{X}$. As an application, we deal with cyclic covers; namely, we…

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

Let $k$ be a number field and $\mathcal{E}$ an elliptic curve defined over the function field $k(T)$ given by an equation of the form $y^2 = a_3x^3 + a_2x^2 + a_1x + a_0$, where $a_i \in k[T]$ and $deg(a_i) \leq 2$. We explore the conic…

Let $k$ be an algebraically closed field of characteristic $p\neq 0$. Let $G$ be a connected reductive group over $k$, $P \subseteq G$ be a parabolic subgroup and $\lambda: P \longrightarrow \mathbb G_m$ be a strictly anti-dominant…

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT…

Let X be a smooth projective curve over a field of characteristic p>0 and G a finite group of automorphism of X. Let n(X,G) be the characteristic of the versal equivariant deformation ring R(X,G) of (X,G). When the ramification is weak…

Let C be an extremal binary doubly even self-dual code of length n and s(C) denote the largest integer t such that the support design of C holds a t-design for some weight. In this paper, we prove s(C) \leq 7.

The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…

We study the arithmetic and geometry properties of the Hecke group $G_q$. In particular, we prove that $G_q$ has a subgroup $X $ of index $d$, genus $g$ with $v_{\infty} $ cusps, and $\tau_2$ (resp. $v_{r_i}$) conjugacy classes of elements…

The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k…

We prove a lower bound $\Omega\left(\frac{k+l}{k^2l^2}N^{2-\frac{k+l+2}{kl}}\right)$ on the maximal possible weight of a $(k,l)$-free (that is, free of all-ones $k\times l$ submatrices) Boolean circulant $N \times N$ matrix. The bound is…

We study the structure and representation theory of the principal W-algebra $\mathsf{W}^{\mathsf{k}}_{\mathrm{pr}}$ of $\mathsf{V}^{\mathsf{k}}(\mathfrak{psl}_{2|2})$. The defining operator product expansions are computed, as is the Zhu…

The thickness of a graph $G=(V,E)$ with $n$ vertices is the minimum number of planar subgraphs of $G$ whose union is $G$. A polyline drawing of $G$ in $\mathbb{R}^2$ is a drawing $\Gamma$ of $G$, where each vertex is mapped to a point and…