Related papers: Weierstrass semigroups and the order bound
In the cut-query model, the algorithm can access the input graph $G=(V,E)$ only via cut queries that report, given a set $S\subseteq V$, the total weight of edges crossing the cut between $S$ and $V\setminus S$. This model was introduced by…
Salazar, Dunn and Graham in [Salazar et. al., 2006] presented an improved Feng-Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further. Both the original bound by Salazar et. al., as well as our…
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 discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…
Fractional Wiener--Weierstrass bridges are a class of Gaussian processes that arise from replacing the trigonometric function in the construction of classical Weierstrass functions by a fractional Brownian bridge. We investigate the sample…
The notion of "Weierstrass Section", comes from Weierstrass canonical form for elliptic curves. In celebrated work [B. Kostant, Lie group representations on polynomial rings, Amer. J. Math. 85 (1963), 327-404] constructed such a section for…
In a recent work we have found a contraction semigroup able to correctly approximate a projected and perturbed one-parameter group of isometries in a generic Banach space, in the limit of weak-coupling. Here we study its generator by…
We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…
Full Vertex Operator Algebras (full VOA) are extensions of two commuting Vertex Operator Algebras, introduced to formulate compact two-dimensional conformal field theory. We define unitarity, polynomial energy bounds and polynomial spectral…
In this work we will introduce the concept of ratio-covariety, as a nonempty family $\mathscr{R}$ of numerical semigroups verifying certain properties. This concept will allow us to: \begin{enumerate} \item Describe an algorithmic process…
This survey describes the method of approximation of operator semigroups, based on the Chernoff theorem. We outline recent results in this domain as well as clarify relations between constructed approximations, stochastic processes,…
Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.
We propose and analyse a boundary-preserving numerical scheme for the weak approximation for some stochastic partial differential equations (SPDEs) with bounded state-space. We impose regularity assumptions on the drift and diffusion…
In this review we focus on the almost diagonalization of pseudodifferential operators and highlight the advantages that time-frequency techniques provide here. In particular, we retrace the steps of an insightful paper by Gr\"ochenig, who…
The Fourier and Fourier-Stieltjes algebras $A(G)$ and $B(G)$ of a locally compact group $G$ are introduced and studied in 60's by Piere Eymard in his PhD thesis. If $G$ is a locally compact abelian group, then $A(G)\simeq L^1(\hat{G})$, and…
A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…
Motivated by the beautiful work of M. A. Rieffel (1965) and of M. E. Walter (1974), we obtain characterisations of the Fourier algebra $A(G)$ of a locally compact group $G$ in terms of the class of $F$-algebras (i.e. a Banach algebra $A$…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…
Let C be a complete non-singular irreducible curve of genus 4 over an algebraically closed field of characteristic 0. We determine all possible Weierstrass semigroups of ramification points on double covers of C which have genus greater…