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

A Roman dominating function on a graph $G$ is a labeling $f : V(G) \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The Roman domination number, $\gamma_R(G)$, of $G$ is the minimum of…

Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…

We study the coloring problem: Given a graph G, decide whether $c(G) \leq q$ or $c(G) \ge Q$, where c(G) is the chromatic number of G. We derive conditional hardness for this problem for any constant $3 \le q < Q$. For $q\ge 4$, our result…

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

Let C be an ACM (projectively normal) nondegenerate smooth curve in projective 3-space, and suppose C is general in its Hilbert scheme - this is irreducible once the postulation is fixed. Answering a question posed by Peskine, we show the…

This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\tilde{\Omega}(n^2)$ lower bounds for cornerstone problems,…

The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…

Over a finite field $\F_q$ the $(n,d,q)$-Reed-Muller code is the code given by evaluations of $n$-variate polynomials of total degree at most $d$ on all points (of $\F_q^n$). The task of testing if a function $f:\F_q^n \to \F_q$ is close to…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

A graph $G$ is {\it weakly semiregular} if there are two numbers $a,b$, such that the degree of every vertex is $a$ or $b$. The {\it weakly semiregular number} of a graph $G$, denoted by $wr(G)$, is the minimum number of subsets into which…

Let ${\mathcal L}/{\mathcal K}$ be a finite Galois extension and let $X$ be an affine algebraic variety defined over ${\mathcal L}$. Weil's Galois descent theorem provides necessary and sufficient conditions for $X$ to be definable over…

The Offensive Alliance problem has been studied extensively during the last twenty years. A set $S\subseteq V$ of vertices is an offensive alliance in an undirected graph $G=(V,E)$ if each $v\in N(S)$ has at least as many neighbours in $S$…

Let Y be a complex algebraic curve and let [Y]={X_1,...,X_n} be the set of all real algebraic curves X_i with complexification X_i(C)=Y, such that the real points X_i(R) divide X_i(C). We find all such families [Y]. According to Harnak…

The shadow-complexity is an invariant of closed $4$-manifolds defined by using $2$-dimensional polyhedra called Turaev's shadows, which, roughly speaking, measures how complicated a $2$-skeleton of the $4$-manifold is. In this paper, we…

We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a…

We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…

Let X be a minimal surface of general type with positive geometric genus ($b_+ > 1$) and let $K^2$ be the square of its canonical class. Building on work of Khodorovskiy and Rana, we prove that if X develops a Wahl singularity of length…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…