相关论文: Bounding the trellis state complexity of algebraic…

The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…

The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular…

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…

For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$. We consider a…

We show that efficient geodesics have the strong property of "super efficiency". For any two vertices, $v , w \in \mathcal{C}(S_g)$, in the complex of curves of a closed oriented surface of genus $g \geq 2 $, and any efficient geodesic, $v…

In this paper we use admissible covers to investigate the gonality of a stable curve $C$ over $\mathbb{C}$. If $C$ is irreducible, we compare its gonality to that of its normalization. If $C$ is reducible, we compare its gonality to that of…

Let $\mathfrak{g}=\mathfrak{g}_{\bar{0}}\oplus \mathfrak{g}_{\bar{1}}$ be a classical Lie superalgebra and $\mathcal{F}$ be the category of finite dimensional $\mathfrak{g}$-supermodules which are completely reducible over the reductive Lie…

A {\it 2-rainbow domination function} of a graph $G$ is a function $f$ that assigns to each vertex a set of colors chosen from the set $\{1,2\}$, such that for any $v\in V(G)$, $f(v)=\emptyset$ implies $\bigcup_{u\in N(v)}f(u)=\{1,2\}$. The…

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…

We are interested in computing the treewidth $\tw(G)$ of a given graph $G$. Our approach is to design heuristic algorithms for computing a sequence of improving upper bounds and a sequence of improving lower bounds, which would hopefully…

A double Roman Dominating function on a graph $G$ is a function $ f:V\rightarrow \{0,1,2,3\}$ such that the following conditions hold. If $f(v)=0$, then vertex $v$ must have at least two neighbors in $V_2$ or one neighbor in $V_3$ and if…

We study the query complexity of geodesically convex (g-convex) optimization on a manifold. To isolate the effect of that manifold's curvature, we primarily focus on hyperbolic spaces. In a variety of settings (smooth or not; strongly…

Let $\Gamma$ = SL 3 (Z[ 1 2 , i]), let X be any mod-2 acyclic $\Gamma$-CW complex on which $\Gamma$ acts with finite stabilizers and let Xs be the 2-singular locus of X. We calculate the mod-2 cohomology of the Borel constructon of Xs with…

Let $G$ be a reductive group with Borel $B$ and Weyl group $W$. Then $B$-double cosets in $G$ are indexed by the Weyl group, say $O(w)$ for $w\in W$. Then we prove the minimal $B$-double coset in the convolution $O(w_1)*O(w_2)$ is…

We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand, we can obtain approximations of the tree-partition-width efficiently:…

Let $\mathbf{G}$ be a reductive group defined over $\mathbb{Q}$ and let $\mathfrak{S}$ be a Siegel set in $\mathbf{G}(\mathbb{R})$. The Siegel property tells us that there are only finitely many $\gamma \in \mathbf{G}(\mathbb{Q})$ of…

Given a random $n \times n$ symmetric matrix $\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\boldsymbol x^\top \boldsymbol…

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

Graph Burning asks, given a graph $G = (V,E)$ and an integer $k$, whether there exists $(b_{0},\dots,b_{k-1}) \in V^{k}$ such that every vertex in $G$ has distance at most $i$ from some $b_{i}$. This problem is known to be NP-complete even…

We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…