Characterizing Frobenius semigroups by filtration.
Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “On semichained refinements of chains in equivalence lattice. (A note to a theorem of O. Borůvka.)”
Characterizing Frobenius semigroups by filtration.
On a linear Diophantine problem of Frobenius.
Tripathi, Amitabha (2006)
Integers
Similarity:
A common generalization of some identities.
Zhang, Zhizheng, Wang, Jun (2005)
Integers
Similarity:
A simple proof of the geometric-arithmetic mean inequality.
Uchida, Yasuharu (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
A curious identity involving binomial coefficients.
Sun, Zhiwei (2002)
Integers
Similarity:
Some local asymptotic laws for the Cauchy process on the line.
Okoroafor, A.Chukwuemeka (2007)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Full subsets of .
Naranjani, Lila, Mirzavaziri, Madjid (2011)
Journal of Integer Sequences [electronic only]
Similarity:
Regular Expression Quantifiers - m to n Occurrences
Michał Trybulec (2007)
Formalized Mathematics
Similarity:
This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: m to n occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0...