Character (mathematics)

About: Character (mathematics) is a research topic. Over the lifetime, 46723 publications have been published within this topic receiving 411412 citations.

Toward the innovative firm - challenge for R&D management

Abstract: An analysis of the changing character of international competition shows how and why success is increasingly dependent upon the R&D function.

M\"obius Functions and Semigroup Representation Theory II: Character formulas and multiplicities

Abstract: We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota's theory of M\"obius inversion. The technique works for a large class of semigroups including: inverse semigroups, semigroups with commuting idempotents, idempotent semigroups and semigroups with basic algebras. Using these tools we are able to give a complete description of the spectra of random walks on finite semigroups admitting a faithful representation by upper triangular matrices over the complex numbers. These include the random walks on chambers of hyperplane arrangements studied by Bidigare, Hanlon, Rockmere, Brown and Diaconis. Applications are also given to decomposing tensor powers and exterior products of rook matrix representations of inverse semigroups, generalizing and simplifying earlier results of Solomon for the rook monoid.

Address reader, sorting machine such as a mail thing and character string recognition method

Abstract: An address reader method and apparatus for recognizing a receiver address on a surface of mail. In the invention an image of the surface of the mail is input and segmented into at least one character string candidate. At least one address area candidate is extracted from the image based upon the segmented character string candidate. One of the address area candidates extracted from the image is selected as a receiver address of the mail by analyzing each of the address area candidates based on predetermined position information indicating a usual position of a receiver address area, character direction information indicating a character direction of a character string appropriate for the predetermined position information, and key character string information indicating a character string most likely to exist in a receiver address. Characters in character strings of the selected address area candidate are recognized as a receiver address which is used to sort the mail.

Design of a linguistic postprocessor using variable memory length Markov models

Abstract: We describe a linguistic postprocessor for character recognizers. The central module of our system is a trainable variable memory length Markov model (VLMM) that predicts the next character given a variable length window of past characters. The overall system is composed of several finite state automata, including the main VLMM and a proper noun VLMM. The best model reported in the literature (Brown et al., 1992) achieves 1.75 bits per character on the Brown corpus. On that same corpus, our model, trained on 10 times less data, reaches 2.19 bits per character and is 200 times smaller (/spl sime/160,000 parameters). The model was designed for handwriting recognition applications but could also be used for other OCR problems and speech recognition.