Related papers: Weierstrass semigroups and the order bound

We describe new families of Eliahou semigroups, encompassing previous families described by Delgado, Eliahou and Fromentin, and Bras-Amor\'os. A crucial parameter is a Farey interval associated to the semigroup. We show that these…

We introduce the notion of halfspaces associated to a group splitting, and investigate the relationship between the coarse geometry of the halfspaces and the coarse geometry of the group. Roughly speaking, the halfspaces of a group…

Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n…

We study first order equations of continuity and transport type on metric spaces of martingale dimension one, including finite metric graphs, p.c.f. self-similar sets and classical Sierpi\'nski carpets. On such spaces solutions of the…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…

The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…

Galois rings and orders, introduced by Futorny and Ovsienko, are embedded into fixed subrings of skew group (or monoid) rings and have many interesting applications to the structure and representation theory of algebras. The paper focuses…

S. B. Rao conjectured that graphic sequences are well-quasi-ordered under an inclusion based on induced subgraphs. This conjecture has now been proved by Chudnovsky and Seymour. We give an independent short proof of the labelled version of…

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

We study distributionally robust optimization (DRO) problems with uncertainty sets consisting of high-dimensional random vectors that are close in the multivariate Wasserstein distance to a reference random vector. We give conditions when…

In this article we explicitly determine the Weierstrass semigroup at any point and the full automorphism group of a known $\mathbb{F}_{q^2}$-maximal curve $\mathcal{X}_3$ having the third largest genus. This curve arises as a Galois…

In this paper we study the main properties of the Ces\`aro means of bi-continuous semigroups, introduced and studied by K\"{u}hnemund in [24]. We also give some applications to Feller semigroups generated by second-order elliptic…

Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…

The most useful and interesting line bundles over algebraic curves of a very high genus have the ratio \delta of the degree to the genus close to half-integer values, usually \delta \approx 0, \delta \approx 1/2, or \delta \approx 1; the…

The notion of interval order was introduced by Norbert Wiener \cite{wie} in order to clarify the relation between the notion of an instant of time and that of a period of time. This was a problem on which Bertrand Russell \cite{rus} worked…

Matthews and Michel investigated the minimum distances in certain algebraic-geometry codes arising from a higher degree place $P$. In terms of the Weierstrass gap sequence at $P$, they proved a bound that gives an improvement on the…

The purpose of this paper is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on $\Vert…

Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…

We study operator-splitting schemes for approximating Koopman generators of linear semigroups induced by nonlinear flows, a framework originating with Dorroh and Neuberger. Building on ideas of Lie, Kowalewski, and Gr\"{o}bner, we analyze…

We study the problem of computing a minimum $s$--$t$ cut in an unweighted, undirected graph via \emph{cut queries}. In this model, the input graph is accessed through an oracle that, given a subset of vertices $S \subseteq V$, returns the…