Related papers: A note about words which coincide except in one po…
Based on the notions of conciseness and semiconciseness, we show that these properties are not equivalent by proving that a word originally presented by Ol'shanskii is semiconcise but not concise. We further establish that every…
The purpose of this short note is to show how it is possible to combine existing results in the literature to get the unique continuation from sets of positive measure for time dependent parabolic equations with Lipschitz principal part and…
Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as…
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS. We wish to continually update the present document by adding…
In this paper, we prove coincidence and common fixed points results under nonlinear contractions on a metric space equipped with an arbitrary binary relation. Our results extend, generalize, modify and unify several known results especially…
We combine the fixed-order evaluation of the $b\bar{b}$ sum rules with a non-relativistic effective-theory approach. The combined result for the $n$-th moment includes all terms suppressed with respect to the leading-order result by ${\cal…
In this paper, we give a counter-example, in the general case, Kronecker theorem will derive contradiction. Kronecker theorem be correct after removing some conditions.
This note imparts heuristic arguments and theorectical evidences that contradict the abc conjecture over the rational numbers. In addition, the rudimentary datails for transforming this problem into the doimain of equidistribution theory…
We give a simple proof of a recent result by J. Schleischitz dealing with a counterexample to the uniform Littlewood conjecture. Our construction is based on simple properties of Fibonacci numbers.
In extending results from Lie to Leibniz algebras, it is helpful to have techniques which translate results from the former to the latter without having to repeat the (perhaps modified) arguments. Such a technique is developed in this work,…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
We report the results of our empirical investigations on the Bateman-Horn conjecture. This conjecture, in its commonly known form, produces rather large deviations when the polynomials involved are not monic. We propose a modified version…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
In this note we provide some results related to the Koethe conjecture and exhibit that the condition R satisfies the Koethe conjecture given in [2, theorem 2.6 ] is superfluous at least under certain conditions described in this note.
In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
In 2013, Fici and Zamboni proved a number of theorems about finite and infinite words having only a small number of factors that are palindromes. In this paper we rederive some of their results, and obtain some new ones, by a different…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…