Nash multiplicities and isolated points of maximum multiplicity

Let X be an algebraic variety defined over a field of characteristic zero, and let $\xi \in \underset{\_}{\mathrm{Max}}\mathrm{mult}(X)$ be a point in the closed subset of maximum multiplicity of X. We provide a criterion, given in terms of arcs, to determine whether ξ is isolated in $\underset{\_}{\mathrm{Max}}\mathrm{mult}(X)$. More precisely, we use invariants of arcs derived from the Nash multiplicity sequence to characterize when ξ is an isolated point in $\underset{\_}{\mathrm{Max}}\mathrm{mult}(X)$.     

The projective dimension of three cubics is at most 5

Let R be a polynomial ring over a field and I an ideal generated by three forms of degree three. Motivated by Stillman's question, Engheta proved that the projective dimension $\mathrm{pd}(R/I)$ of $R/I$ is at most 36, although the example with largest projective dimension he constructed has $\mathrm{pd}(R/I)=5$. Based on computational evidence, it had been conjectured that $\mathrm{pd}(R/I)\le 5$. In the present paper we prove this conjectured sharp bound.     

The structure of the minimal free resolution of semigroup rings obtained by gluing

We construct a minimal free resolution of the semigroup ring $k[C]$ in terms of minimal resolutions of $k[A]$ and $k[B]$ when $〈C〉$ is a numerical semigroup obtained by gluing two numerical semigroups $〈A〉$ and $〈B〉$. Using our explicit construction, we compute the Betti numbers, graded Betti numbers, regularity and Hilbert series of $k[C]$, and prove that the minimal free resolution of $k[C]$ has a differential graded algebra structure provided the resolutions of $k[A]$ and $k[B]$ possess them. We discuss the consequences of our results in small embedding dimensions. Finally, we give an extension of our main result to semigroups in ${\mathbb{N}}^n$.     

On the universal completion of pointfree function spaces

This paper approaches the construction of the universal completion of the Riesz space $\mathrm{C}(L)$ of continuous real functions on a completely regular frame L in two different ways. Firstly as the space of continuous real functions on the Booleanization of L. Secondly as the space of nearly finite Hausdorff continuous functions on L. The former has no counterpart in the classical theory, as the Booleanization of a spatial frame is not spatial in general, and it offers a lucid way of representing the universal completion as a space of continuous real functions. As a corollary we obtain that $\mathrm{C}(L)$ and $\mathrm{C}(M)$ have isomorphic universal completions if and only if the Booleanization of L and M are isomorphic and we characterize frames L such that $\mathrm{C}(L)$ is universally complete as almost Boolean frames. The application of this last result to the classical case $\mathrm{C}(X)$ of the space of continuous real functions on a topological space X characterizes those spaces X for which $\mathrm{C}(X)$ is universally complete. Finally, we present a pointfree version of the Maeda-Ogasawara-Vulikh representation theorem and use it to represent the universal completion of an Archimedean Riesz space with weak unit as a space of continuous real functions on a Boolean frame.     

Weierstrass weight of the hyperosculating points of generalized Fermat curves

Let $(S,H)$ be a generalized Fermat pair of the type $(k,n)$. If $F?S$ is the set of fixed points of the non-trivial elements of the group H, then F is exactly the set of hyperosculating points of the standard embedding $S?{\mathbb{P}}^n$. We provide an optimal lower bound (this being sharp in a dense open set of the moduli space of the generalized Fermat curves) for the Weierstrass weight of these points.     

A note on one-sided interval edge colorings of bipartite graphs

For a bipartite graph G with parts X and Y, an X-interval coloring is a proper edge coloring of G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by ${\chi }_{int}^{\prime }(G,X)$ the minimum k such that G has an X-interval coloring with k colors. Casselgren and Toft (2016) [12] asked whether there is a polynomial $P(\mathrm{\Delta })$ such that if G has maximum degree at most Δ, then ${\chi }_{int}^{\prime }(G,X)\le P(\mathrm{\Delta })$. In this short note, we answer this question in the affirmative; in fact, we prove that a cubic polynomial suffices. We also deduce some improved upper bounds on ${\chi }_{int}^{\prime }(G,X)$ for bipartite graphs with small maximum degree.     

Noetherian-like properties in polynomial and power series rings

There are many Noetherian-like rings. Among them, we are interested in SFT-rings, piecewise Noetherian rings, and rings with Noetherian prime spectrum. Some of them are stable under polynomial extensions but none of them are stable under power series extensions. We give partial answers to some open questions related with stabilities of such rings. In particular, we show that any mixed extensions $R[X_1??[X_n?$ over a zero-dimensional SFT ring R are also SFT-rings, and that if R is an SFT-domain such that $R/P$ is integrally closed for each prime ideal P of R, then $R[X]$ is an SFT-ring. We also give a direct proof that if R is an SFT Prüfer domain, then $R[X_1,?,X_n]$ is an SFT-ring. Finally, we show that the power series extension $R?X?$ over a Prüfer domain R is piecewise Noetherian if and only if R is Noetherian.     

Hamiltonian and long paths in bipartite graphs with connectivity

Let G be a graph, $\nu (G)$ the order of G, $\kappa (G)$ the connectivity of G and k a positive integer such that $k\le (\nu (G)?2)/2$. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets $V_1$ and $V_2$ is defined to be Hamiltonian-laceable if such that $|V_1|=|V_2|$ and for every pair of vertices $p\in V_1$ and $q\in V_2$, there exists a Hamiltonian path in G with endpoints p and q, or $|V_1|=|V_2|+1$ and for every pair of vertices $p,q\in V_1,p\ne q$, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition $(X,Y)$. Define $bn(G)$ to be a maximum integer such that $0\le bn(G)<min\{|X|,|Y|\}$ and (1) for each non-empty subset S of X, if $|S|\le |X|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|X|?bn(G)<|S|\le |X|$, then $N(S)=Y$; and (2) for each non-empty subset S of Y, if $|S|\le |Y|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|Y|?bn(G)<|S|\le |Y|$, then $N(S)=X$; and (3) $bn(G)=0$ if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|$ and $bn(G)>0$. In this paper, we show that if $\nu (G)\le 2\kappa (G)+4bn(G)?4$, then G is Hamiltonian-laceable; or if $\nu (G)>6bn(G)?2$, then for every pair of vertices $x\in X$ and $y\in Y$, there is an $(x,y)$-path P in G with $|V(P)|\ge 6bn(G)?2$. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.     

Projective generation of ideals in a certain ring

Let R be an affine domain of dimension $n\ge 3$ over a field of characteristic 0 and $D=R[X,Y]/(XY)$. Let $I?D$ be a local complete intersection ideal of height n such that $\mu (I/I^2)=n$. This paper examines under what condition I is surjective image of a projective D-module of rank n.     

Annihilator condition does not pass to polynomials and power series

In this paper we construct a ring A which has annihilator condition (a.c.) and we show that neither $A[x]$ nor $A[[x]]$ has this property. This answers in negative a question asked by Hong, Kim, Lee and Nielsen. We also show that there is an algebra A which does not have annihilator condition while both $A[x]$ and $A[[x]]$ have this property.     

On the equational graphs over finite fields

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y)=0$ with variables X and Y over a finite field ${\mathbb{F}}_q$ of odd characteristic, we define a digraph by choosing the elements in ${\mathbb{F}}_q$ as vertices and drawing an edge from x to y if and only if $E(x,y)=0$. We call this graph as equational graph. In this paper, we study the equational graph when choosing $E(X,Y)=(Y^2-f(X))(\lambda Y^2-f(X))$ with $f(X)$ a polynomial over ${\mathbb{F}}_q$ and λ a non-square element in ${\mathbb{F}}_q$. We show that if f is a permutation polynomial over ${\mathbb{F}}_q$, then every connected component of the graph has a Hamiltonian cycle. Moreover, these Hamiltonian cycles can be used to construct balancing binary sequences. By making computations for permutation polynomials f of low degree, it appears that almost all these graphs are strongly connected, and there are many Hamiltonian cycles in such a graph if it is connected.