Moment subset sums over finite fields

The k-subset sum problem over finite fields is a classical NP-complete problem. Motivated by coding theory applications, a more complex problem is the higher m-th moment k-subset sum problem over finite fields. We show that there is a deterministic polynomial time algorithm for the m-th moment k-subset sum problem over finite fields for each fixed m when the evaluation set is the image set of a monomial or Dickson polynomial of any degree n. In the classical case $m=1$, this recovers previous results of Nguyen-Wang (the case $m=1,p>2$) [22] and the results of Choe-Choe (the case $m=1,p=2$) [3].     

A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints

Let $k\ge 4$ and $n\ge k+4$ be positive integers. We determine the maximum size of digraphs of order $n$ that avoid distinct walks of length $k$ with the same endpoints. We also characterize the extremal digraphs attaining this maximum number when $k\ge 5$.     

Spanning trees with at most 4 leaves in K1,5-free graphs

In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with ${\sigma }_4\left(G\right)\ge n?1$ contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected $K_{1,5}$-free graphs. We show that every $n$-vertex connected $K_{1,5}$-free graph $G$ with ${\sigma }_5\left(G\right)\ge n?1$ contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “${\sigma }_5\left(G\right)\ge n?1$” is best possible.     

3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices

Let $g(k,t)$ be the minimum integer such that every plane graph with girth g at least $g(k,t)$, minimum degree $\delta =2$ and no $(k+1)$-paths consisting of vertices of degree 2, where $k\ge 1$, has a 3-vertex with at least t neighbors of degree 2, where $1\le t\le 3$.In 2015, Jendrol' and Maceková proved $g(1,1)\le 7$. Later on, Hudák et al. established $g(1,3)=10$, Jendrol', Maceková, Montassier, and Soták proved $g(1,1)\ge 7$, $g(1,2)=8$ and $g(2,2)\ge 11$, and we recently proved that $g(2,2)=11$ and $g(2,3)=14$.Thus $g(k,t)$ is already known for $k=1$ and all t. In this paper, we prove that $g(k,1)=3k+4$, $g(k,2)=3k+5$, and $g(k,3)=3k+8$ whenever $k\ge 2$.     

Classification of metabelian 2-groups G with Gab ≃ (2,2n),n ≥ 2, and rank d(G′)=2; Applications to real quadratic number fields

We characterize all finite metabelian 2-groups G whose abelianizations $G^{\mathrm{ab}}$ are of type $(2,2^n)$, with $n\ge 2$, and for which their commutator subgroups $G^{\prime }$ have $\text{rank}=2$. This is given in terms of the order of the abelianizations of the maximal subgroups and the structure of the abelianizations of those normal subgroups of index 4 in G. We then translate these group theoretic properties to give a characterization of number fields k with 2-class group ${\mathrm{Cl}}_2(k)?(2,2^n)$, $n\ge 2$, such that the rank of ${\mathrm{Cl}}_2(k^1)=2$ where $k^1$ is the Hilbert 2-class field of k. In particular, we apply all this to real quadratic number fields whose discriminants are a sum of two squares.     

Improvements on Hippchen's conjecture

Let G be a k-connected graph on n vertices. Hippchen's Conjecture (2008) states that two longest paths in G share at least k vertices. Gutiérrez (2020) recently proved the conjecture when $k\le 4$ or $k\ge \frac{n?2}{3}$. We improve upon both results; namely, we show that two longest paths in G share at least k vertices when $k=5$ or $k\ge \frac{n+2}{5}$. This completely resolves two conjectures by Gutiérrez in the affirmative.     

Largest regular multigraphs with three distinct eigenvalues

We deal with connected $k$-regular multigraphs of order $n$ that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given $k$. For $k=2,3,7$, the Moore graphs are largest. For $k\ne 2,3,7,57$, we show an upper bound $n\le k^2?k+1$, with equality if and only if there exists a finite projective plane of order $k?1$ that admits a polarity.     

Constructions of optimal orthogonal arrays with repeated rows

We construct orthogonal arrays ${\mathsf{OA}}_{\lambda }(k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m∕\lambda$ is as large as possible; these OAs are termed optimal. We provide constructions of optimal OAs for any $k\ge n+1$, albeit with large $\lambda$. We also study basic OAs; these are optimal OAs in which $gcd(m,\lambda )=1$. We construct a basic OA with $n=2$ and $k=4t+1$, provided that a Hadamard matrix of order $8t+4$ exists. This completely solves the problem of constructing basic OAs with $n=2$, modulo the Hadamard matrix conjecture.     

Construction of systematic (k + 1,k) memory MDS sliding window codes over embedded fields

In this paper, based on the structure of embedded fields, we investigate explicit construction of systematic $(k+1,k)$ mMDS sliding window codes with memory $m=2,3$. First, over GF($2^{lh}$) with $l\ge 1$ and $h\ge 2$, we propose an algorithm to construct $(2^{lh-1}+1,2^{lh-1})$ mMDS codes with memory 2, which are optimal in the sense that $2^{lh-1}$ is the maximum possible value of k for a $(k+1,k)$ sliding window code with memory 2 over GF($2^{lh}$) to be mMDS. When $l\ge 2$, every constructed code has the extra property that it contains a $(2^{h-1}+1,2^{h-1})$ mMDS sliding window code with memory 2 as a subcode over the subfield GF($2^h$). Next, over GF($2^{2lh}$) with $l\ge 1$ and $h\ge 2$, we introduce a method to construct $(k+1,k)$ mMDS codes memory 3, and a few new codes have been obtained consequently. When $l\ge 2$, every code constructed by the new approach also has the property that it contains an mMDS subcode over the subfield GF($2^{2h}$). The embedding subfield-subcode property enhances the flexibility and efficiency of the designed codes.