English
Related papers

Related papers: A note about words which coincide except in one po…

200 papers

This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…

Formal Languages and Automata Theory · Computer Science 2020-09-03 Stefan Kiefer

In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.

Combinatorics · Mathematics 2011-03-29 Mateusz Michalek

A simple proof of the celebrated theorem of Lee and Yang is attempted in this short note.

Statistical Mechanics · Physics 2012-01-17 Ranjan Kumar Ghosh

This note presents a unified theorem of the alternative that explicitly allows for any combination of equality, componentwise inequality, weak dominance, strict dominance, and nonnegativity relations. The theorem nests 60 special cases,…

Theoretical Economics · Economics 2023-03-15 Ian Ball

In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.

Number Theory · Mathematics 2025-06-03 Tomohiro Yamada

We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.

General Topology · Mathematics 2016-11-25 Hassen Aydi

This very short correction notes a gap in an argument of an earlier paper, and also provides a theorem of similar flavor to the main result of that paper.

Group Theory · Mathematics 2022-09-27 Samuel M. Corson

Co-occurrences between two words provide useful insights into the semantics of those words. Consequently, numerous prior work on word embedding learning have used co-occurrences between two words as the training signal for learning word…

Computation and Language · Computer Science 2017-09-06 Danushka Bollegala , Yuichi Yoshida , Ken-ichi Kawarabayashi

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

General Mathematics · Mathematics 2019-07-25 K. K. Kataria

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

Functional Analysis · Mathematics 2025-09-10 Babu G. V. R. , Alemayehu Negash , Sandhya M. L. , Meaza Bogale

In this short note is on the equivalence between non-Newtonian metric (particularly multiplicative metric) and metric. We present a different proof the fact that the notion of a non-Newtonian metric space is not more general than that of a…

Functional Analysis · Mathematics 2016-03-14 Bahri Turan , Cuneyt Cevik

In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones

Functional Analysis · Mathematics 2025-10-28 Murphy E. Egwe , Funke Yusuf

We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…

Formal Languages and Automata Theory · Computer Science 2017-08-23 F. Blanchet-Sadri , Kun Chen , Kenneth Hawes

In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situation where the original theorem does not seem to work.

Combinatorics · Mathematics 2021-12-07 Michał Lasoń

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

Formal Languages and Automata Theory · Computer Science 2012-03-30 Dane Henshall , Jeffrey Shallit

We present several short proofs that resolve open problems from the algebraic and enumerative combinatorics literature. First, we consider the echelonmotion operator on modular lattices. We resolve a conjecture of Defant, Jiang, Marczinzik,…

Combinatorics · Mathematics 2026-05-26 Colin Defant

In this paper, we introduce the concept of mixed (G, S)-monotone mappings and prove coupled coincidence and coupled common fixed point theorems for such mappings satisfying a nonlinear contraction involving altering distance functions.…

General Topology · Mathematics 2011-05-17 Habib Yazidi

In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.

Formal Languages and Automata Theory · Computer Science 2022-10-11 Maria Kosche , Tore Koß , Florin Manea , Stefan Siemer

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Logic in Computer Science · Computer Science 2022-04-06 Aliaume Lopez

The purpose of this note is to present two elementary, but useful, facts concerning actions on uniformly convex spaces. We demonstrate how each of them can be used in an alternative proof of the triviality of the first $L_p$-cohomology of…

Group Theory · Mathematics 2008-05-27 tsachik gelander