Related papers: Flag-Shaped Blockers of 123-Avoiding Permutation M…

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

Matrix factorization is an important representation learning algorithm, e.g., recommender systems, where a large matrix can be factorized into the product of two low dimensional matrices termed as latent representations. This paper…

We investigate the adjacency matrices of zero-divisor graphs derived from Lipschitz quaternion rings modulo \(n\). For odd primes \(p\), utilizing the isomorphism \(\LL_p\cong M_2(\F_p)\), we categorize vertices by kernel-image type and…

Fix a flat and projective morphism $X\rightarrow\Sigma$ of schemes. We show, first, that any set of $\mathbb{P}^1$-fibrations on $X$ defines a set of simple roots, a set of simple coroots and a Cartan matrix $C$. Second, $X$ is an \'etale…

A planar graph $G$ is called a pentagulation of an $n$-gon ($n\geq$ is an integer) if all faces of $G$ are pentagons, except one, which is an $n$-gon. A $3$-connected pentagulation $G$ of an $n$-gon is called minimal if it has the smallest…

We investigate random minimal factorizations of the $n$-cycle, that is, factorizations of the permutation $(1 \, 2 \cdots n)$ into a product of cycles $\tau_1, \ldots, \tau_k$ whose lengths $\ell(\tau_1), \ldots, \ell(\tau_k)$ verify the…

Blocking sets and minimal codes have been studied for many years in projective geometry and coding theory. In this paper, we provide a new lower bound on the size of $t$-fold $s$-blocking sets without the condition $t \leq q$, which is…

Baxter permutations are a class of permutations which are in bijection with a class of floorplans that arise in chip design called mosaic floorplans. We study a subclass of mosaic floorplans called $HFO_k$ defined from mosaic floorplans by…

We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which…

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

Strong blocking sets, introduced first in 2011 in connection with saturating sets, have recently gained a lot of attention due to their correspondence with minimal codes. In this paper, we dig into the geometry of the concatenation method,…

Locating-dominating codes have been studied widely since their introduction in the 1980s by Slater and Rall. In this paper, we concentrate on vertices that must belong to all minimum locating-dominating codes in a graph. We call them…

In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…

Metric dimension is a graph parameter that has been applied to robot navigation and finding low-dimensional vector embeddings. Throttling entails minimizing the sum of two available resources when solving certain graph problems. In this…

Boolean cardinality constraints state that at most (at least, or exactly) $k$ out of $n$ propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator…

This paper investigates the geometry of regular Hessenberg varieties associated with the minimal indecomposable Hessenberg space in the flag variety of a complex reductive group. These varieties form a flat family of irreducible…

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen…

In an undirected graph $G$, a subset $C\subseteq V(G)$ such that $C$ is a dominating set of $G$, and each vertex in $V(G)$ is dominated by a distinct subset of vertices from $C$, is called an identifying code of $G$. The concept of…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $\gamma > 0$ such that if $n=2t$ and $A$ is a $3$-dimensional $n\times n\times…