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

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Let $C$ be a two and three-weight ternary code. Furthermore, we assume that $C_\ell$ are $t$-designs for all $\ell$ by the Assmus--Mattson theorem. We show that $t \leq 5$. As a corollary, we provide a new characterization of the (extended)…

We show that taking account of bounded curvature reduces the threshold regularity of connection coefficients required for existence and uniqueness of solutions to the geodesic equation, to $L^p_\text{loc}$, one derivative below the…

Let SU_C(2) denote the moduli variety of rank 2 semistable vector bundles with trivial determinant on an algebraic curve C. We prove that if C is trigonal then there exists a projective moduli variety N_C containing SU_C(2) as a subvariety…

In this paper, we prove the following "Weak Bounded Negativity Conjecture", which says that given a complex smooth projective surface $X$, for any reduced curve $C$ in $X$ and integer $g$, assume that the geometric genus of each component…

We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire…

A graph is weakly $2$-colored if the nodes are labeled with colors black and white such that each black node is adjacent to at least one white node and vice versa. In this work we study the distributed computational complexity of weak…

We associate vertex operator algebras to $(p,q)$-webs of interfaces in the topologically twisted $\mathcal{N}=4$ super Yang-Mills theory. Y-algebras associated to trivalent junctions are identified with truncations of…

We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight.

Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of…

Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

We find modular transformations of normalized characters for the following $W$-algebras: (a) $W^{min}_k(\frak{g})$, where $\frak{g}=D_n \, (n \geq 4)$, or $E_6$, $E_7$, $E_8$, and $k$ is a negative integer $\geq -2$, or $\geq…

We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…

A resolving set $S$ of a graph $G$ is a subset of its vertices such that no two vertices of $G$ have the same distance vector to $S$. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a…

The open subvariety $\overline{M}_g^{\leq k}$ of $\overline{M}_g$ parametrizes stable curves of genus $g$ having at most $k$ rational components. By the work of Looijenga, one expects that the cohomological excess of $\overline{M}_g^{\leq…

It is a well-known result that a stable curve of compact type over $\mathbb{C}$ having two components is hyperelliptic if and only if both components are hyperelliptic and the point of intersection is a Weierstrass point for each of them.…

We show that any quantum algorithm deciding whether an input function $f$ from $[n]$ to $[n]$ is 2-to-1 or almost 2-to-1 requires $\Theta(n)$ queries to $f$. The same lower bound holds for determining whether or not a function $f$ from…

It is known that for a curve defined over $\mathbb{Q}$ of genus $g \leq 4$, there exists a point on the curve defined over a solvable extension of $\mathbb{Q}$. We relate points on curves of genus $g \geq 5$ over solvable extensions to the…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…