Search results for "HM"

On the number of covering blocks

1995

Characters that agree on prime-power-order elements

2003

Some Open Problems on Coprime Action and Character Correspondences

1994

Nonstochastic languages as projections of 2-tape quasideterministic languages

1998

A language L (n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-e, for arbitrary e > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is a projection of a quasideterministic language L (n) of n-tuples of words. Had projections of quasideterministic languages on one tape always been rational stochastic languages, we would have a good characterization of the class of the rational stochastic languages. However we prove the opposite in this paper. A two-tape quasideterministic language exists, the projection of which on the first tape is a nonstochastic language.

Inductive synthesis of dot expressions

2005

We consider the problem of the synthesis of algorithms by sample computations. We introduce a formal language, namely, the so-called dot expressions, which is based on a formalization of the intuitive notion of ellipsis (‘...’). Whilst formally the dot expressions are simply a language describing sets of words, on the other hand, it can be considered as a programming language supporting quite a wide class of programs. Equivalence and asymptotical equivalence of dot expressions are defined and proved to be decidable. A formal example of a dot expression is defined in the way that, actually, it represents a sample computation of the program presented by the given dot expression. A system of s…

Counterexamples for unique continuation

1988

Enumerative Aspects of the Gross-Siebert Program

2015

For the last decade, Mark Gross and Bernd Siebert have worked with a number of collaborators to push forward a program whose aim is an understanding of mirror symmetry. In this chapter, we’ll present certain elements of the “Gross-Siebert” program. We begin by sketching its main themes and goals. Next, we review the basic definitions and results of two main tools of the program, logarithmic and tropical geometry. These tools are then used to give tropical interpretations of certain enumerative invariants. We study in detail the tropical pencil of elliptic curves in a toric del Pezzo surface. We move on to a basic illustration of mirror symmetry, Gross’s tropical construction for \(\mathbb{P…

Erratum/Addendum to the paper ``Some seminorms on quasi*-algebras" (Studia Math. 158 (2003), 99–115)

2004

Numerical evaluation of multiple polylogarithms

2004

Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for arbitrary complex arguments and without any restriction on the weight. We have implemented these algorithms with arbitrary precision arithmetic in C++ within the GiNaC framework.

Some problems in number theory that arise from group theory

2021

In this expository paper, we present several open problems in number theory that have arisen while doing research in group theory. These problems are on arithmetical functions or partitions. Solving some of these problems would allow to solve some open problem in group theory.