Related papers: Minimal value set binomials and Frobenius nonclass…

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

We give an explicit way of writing down a minimal set of generators for the canonical ideal of a non-degenerate curve, or of a more general smooth projective curve in a toric surface, in terms of its defining Laurent polynomial.

We show that a minimal clone has a nontrivial weakly abelian representation iff it has a nontrivial abelian representation, and that in this case all representations are weakly abelian.

In this paper we present a geometrical characterization for the minimum-weight codewords of the Hermitian codes over the fields $\mathbb{F}_{q^2}$ in the third and fourth phase, namely with distance $d \geq q^2-q$. We consider the unique…

Minimizers in the least gradient problem with discontinuous boundary data need not be unique. However, all of them have a similar structure of level sets. Here, we give a full characterization of the set of minimizers in terms of any one of…

A knot is called minimal if its knot group admits epimorphisms onto the knot groups of only the trivial knot and itself. In this paper, we determine which two-bridge knot $\mathfrak{b}(p,q)$ is minimal where $q \leq 6$ or $p \leq 100$.

We present several identities involving quasi-minors of noncommutative generic matrices. These identities are specialized to quantum matrices, yielding q-analogues of various classical determinantal formulas.

We evaluate the variance of coefficients of the characteristic polynomial for binary quantum graphs using a dynamical approach. This is the first example where a spectral statistic can be evaluated in terms of periodic orbits for a system…

A finite non-abelian group $H$ is hamiltonian if all of its subgroups are normal. We compute the minimal orders of graphs having a hamiltonian group as their automorphism group. The fixing number of a graph $\Gamma$ is the minimum…

Let X be a definable sub-set of some o-minimal structure. We study the spectrum of X, in relation with the definability of types.

A graph $G$ is said to be {\it $2$-distinguishable} if there is a labeling of the vertices with two labels so that only the trivial automorphism preserves the labels. The minimum size of a label class, over all 2-distinguishing labelings,…

We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

Let $G$ be a simple connected graph on $n$ vertices and $m$ edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalue $q_n(G)$ of the signless Laplacian of $G$: $\displaystyle…

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of…

We introduce the notion of minimal inversion sequences for a pattern $\rho$, which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of $\rho$ for inversion sequences. We give a characterization of…

Let X be a smooth cubic threefold. We can associate two objects to X: the intermediate Jacobian J and the Fano surface F parametrising lines on X. By a theorem of Clemens and Griffiths, the Fano surface can be embedded in the intermediate…

A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\it et al.} have characterized the minimizing graphs in the class…

The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…

We show that all twist knots, certain double twist knots and some other 2-bridge knots are minimal elements for the partial ordering on the set of prime knots. The key to these results are presentations of their character varieties using…