A constructive solution to a problem of ranking tournaments

A tournament is an oriented complete graph. The problem of ranking tournaments was firstly investigated by P. Erd?s and J. W. Moon. By probabilistic methods, the existence of ?? ?? unrankable” tournaments was proved. On the other hand, they also mentioned the problem of explicit constructions. However, there seems to be only a few of explicit constructions of such tournaments. In this note, we give a construction of many such tournaments by using skew Hadamard difference sets which have been investigated in combinatorial design theory.     

The geometry of border bases

In this paper we continue the study of the border basis scheme we started in Kreuzer and Robbiano (2008) [16]. The main topic is the construction of various explicit flat families of border bases. To begin with, we cover the punctual Hilbert scheme by border basis schemes and work out the base changes. This enables us to control flat families obtained by linear changes of coordinates. Next we provide an explicit construction of the principal component of the border basis scheme, and we use it to find flat families of maximal dimension at each radical point. Finally, we connect radical points to each other and to the monomial point via explicit flat families on the principal component.     

A continuous family of partition statistics equidistributed with length

This article investigates a remarkable generalization of the generating function that enumerates partitions by area and number of parts. This generating function is given by the infinite product _∏i?11/(1−tqi). We give uncountably many new combinatorial interpretations of this infinite product involving partition statistics that arose originally in the context of Hilbert schemes. We construct explicit bijections proving that all of these statistics are equidistributed with the length statistic on partitions of n. Our bijections employ various combinatorial constructions involving cylindrical lattice paths, Eulerian tours on directed multigraphs, and oriented trees.     

Combinatorial bounds on Hilbert functions of fat points in projective space

We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in , in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using nothing more than the multiplicities of the points and information about which subsets of the points are linearly dependent. When N=2, we give these bounds explicitly and we give a sufficient criterion for the upper and lower bounds to be equal. When this criterion is satisfied, we give both a simple formula for the Hilbert function and combinatorially defined upper and lower bounds on the graded Betti numbers for the ideal I_A defining A, generalizing results of Geramita et al. (2006) [16]. We obtain the exact Hilbert functions and graded Betti numbers for many families of examples, interesting combinatorially, geometrically, and algebraically. Our method works in any characteristic.     

On absolute Galois splitting fields of central simple algebras

A splitting field of a central simple algebra is said to be absolute Galois if it is Galois over some fixed subfield of the centre of the algebra. The paper proves an existence theorem for such fields over global fields with enough roots of unity. As an application, all twisted function fields and all twisted Laurent series rings over symbol algebras (or p-algebras) over global fields are crossed products. An analogous statement holds for division algebras over Henselian valued fields with global residue field.The existence of absolute Galois splitting fields in central simple algebras over global fields is equivalent to a suitable generalization of the weak Grunwald-Wang theorem, which is proved to hold if enough roots of unity are present. In general, it does not hold and counter examples have been used in noncrossed product constructions. This paper shows in particular that a certain computational difficulty involved in the construction of explicit examples of noncrossed product twisted Laurent series rings cannot be avoided by starting the construction with a symbol algebra.     

An explication of secret sharing schemes

This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. The main problem we consider is the construction of perfect secret sharing schemes, for specified access structures, with the maximum possible information rate.In this paper, we present numerous direct constructions for secret sharing schemes, such as the Shamir threshold scheme, the Boolean circuit construction of Benaloh and Leichter (for general access structures), the vector space construction of Brickell, and the Simmons geometric construction. We discuss the connections between ideal schemes (i.e., those with information rate equal to one) and matroids. We also mention the entropy bounds of Capocelli et al. Then we give a very general construciton, called the decomposition construction, and numerous applications of it. In particular, we study schemes for access structures based on graphs and the many interesting bounds that can be proved; and we determine the exact value of the optimal information rate for all access structures on at most four participants.Research supported by NSERC (Canada) grant A9287.     

Construction of rigid local systems and integral representations of their sections

We give a method for constructing all rigid local systems of semi‐simple type, which is different from the Katz–Dettweiler–Reiter algorithm. Our method follows from the construction of Fuchsian systems of differential equations with monodromy representations corresponding to such local systems, which give an explicit solution of the Riemann–Hilbert problem. Moreover, we show that every section of such local systems has an integral representation. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lifting constructions of strongly regular Cayley graphs

We give two “lifting” constructions of strongly regular Cayley graphs. In the first construction we “lift” a cyclotomic strongly regular graph by using a subdifference set of the Singer difference sets. The second construction uses quadratic forms over finite fields and it is a common generalization of the construction of the affine polar graphs [7] and a construction of strongly regular Cayley graphs given in [15]. The two constructions are related in the following way: the second construction can be viewed as a recursive construction, and the strongly regular Cayley graphs obtained from the first construction can serve as starters for the second construction. We also obtain association schemes from the second construction.     

Generalized random recursive constructions and geometric properties of random fractals

We study random recursive constructions in which the contracting vectors have different distributions at different stages. With such constructions, the one parameter family of martingales are introduced and the probabilistic behaviours of the limit random objects (not identically distributed) are discussed. We prove that the random fractal associated with such construction has a constant Hausdorff dimension almost surely and give an explicit formula to determine it. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hypocoercivity for Kolmogorov backward evolution equations and applications

In this article we extend the modern, powerful and simple abstract Hilbert space strategy for proving hypocoercivity that has been developed originally by Dolbeault, Mouhot and Schmeiser in [16]. As well-known, hypocoercivity methods imply an exponential decay to equilibrium with explicit computable rate of convergence. Our extension is now made for studying the long-time behavior of some strongly continuous semigroup generated by a (degenerate) Kolmogorov backward operator L. Additionally, we introduce several domain issues into the framework. Necessary conditions for proving hypocoercivity need then only to be verified on some fixed operator core of L. Furthermore, the setting is also suitable for covering existence and construction problems as required in many applications. The methods are applicable to various, different, Kolmogorov backward evolution problems. As a main part, we apply the extended framework to the (degenerate) spherical velocity Langevin equation. This equation e.g. also appears in applied mathematics as the so-called fiber lay-down process. For the construction of the strongly continuous contraction semigroup we make use of modern hypoellipticity tools and perturbation theory.     

Martin boundaries for discrete Markov chains

In this paper we give explicit constructions of the Martin boundary for some discrete Markov chains. This construction is extended to the product of discrete Markov.chains     

An explicit Waldspurger formula for Hilbert modular forms II

The Ramanujan Journal - We describe a construction of preimages for the Shimura map on Hilbert modular forms using generalized theta series, and give an explicit Waldspurger type formula relating...     

Explicit determination of images of Galois representations attached to Hilbert modular forms

In a previous paper the second author proved that the image of the Galois representation modulo λ attached to a Hilbert modular newform is “large” for all but finitely many primes λ, if the newform is not a theta series. In this brief note, we give an explicit bound for this exceptional finite set of primes and determine the images in three different examples. Our examples are of Hilbert newforms on real quadratic fields, of parallel or non-parallel weight and of different levels.