Related papers: Minimum Critical Exponents for Palindromes

We definitively solve the old problem of finding a minimal integrity basis of polynomial invariants of the fourth-order elasticity tensor C. Decomposing C into its SO(3)-irreducible components we reduce this problem to finding joint…

A proper elementary extension of a model is called small if it realizes no new types over any finite set in the base model. We answer a question of Marker, and show that it is possible to have an o-minimal structure with a maximal small…

We derive the local and central limit theorems for the Stirling numbers of the second kind by elementary means, obtaining as corollaries effective asymptotic estimates for the Bell numbers and for the moments of the distribution. We also…

We determine all majority operations on a four-element set that generate a minimal clone.

Let $C(G)$ be the poset of cyclic subgroups of a finite group $G$ and let $\mathcal{P}$ be the class of $p$-groups of order $p^n$ ($n\geq 3$). Consider the function $\alpha:\mathcal{P}\longrightarrow (0, 1]$ given by…

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

In this paper we study the existence of at least two positive weak solutions for an inhomogeneous fourth order equation with Navier boundary data involving nonlinearities of critical growth with a bifurcation parameter $\lambda$ in…

We give asymptotic expressions for the number of commuting matrices over finite fields. For this, we use product expansions for the corresponding generating functions.

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

This paper sets out to study the spectral minimum for operator belonging to the family of random Schr\"{o}dinger operators of the form $H\_{\lambda,\omega}=-\Delta+W\_{\text{per}}+\lambda V\_{\omega}$, where we suppose that $V\_{\omega}$ is…

In [1] we consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization, where we provide a condition which allows to decide whether a solution of the necessary first order conditions…

Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number…

In the vicinity of the onset of an instability, we investigate the effect of colored multiplicative noise on the scaling of the moments of the unstable mode amplitude. We introduce a family of zero dimensional models for which we can…

For every $n\ge 3$ we determine the minimum number of edges of graph with $n$ vertices such that for any non edge $xy$ there exits a hamiltonian cycle containing $xy$.

In this work we use elementary methods to discuss the question of the minimal number of points with bad reduction over the projective line for elliptic curves E/k(T) which are non-constant resp. have non-constant j-invariant.

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…

In the work, the property of the second-order subdifferential is studied and second-order optimality conditions are obtained for the minimization problem. We also obtained necessary and sufficient conditions for an extremum for the extremal…