Search results for "Combinatorics"

A formula for the Euler characteristic of $\overline{{\cal M}}_{2,n}$

2001

In this paper we compute the generating function for the Euler characteristic of the Deligne-Mumford compactification of the moduli space of smooth n-pointed genus 2 curves. The proof relies on quite elementary methods, such as the enumeration of the graphs involved in a suitable stratification of \(\overline{{\cal M}}_{2,n}\).

Quasisymmetric extension on the real line

2015

We give a geometric characterization of the sets $E\subset \mathbb{R}$ that satisfy the following property: every quasisymmetric embedding $f: E \to \mathbb{R}^n$ extends to a quasisymmetric embedding $f:\mathbb{R}\to\mathbb{R}^N$ for some $N\geq n$.

An unbounded family of log Calabi–Yau pairs

2016

We give an explicit example of log Calabi-Yau pairs that are log canonical and have a linearly decreasing Euler characteristic. This is constructed in terms of a degree two covering of a sequence of blow ups of three dimensional projective bundles over the Segre-Hirzebruch surfaces ${\mathbb F}_n$ for every positive integer $n$ big enough.

Some considerations on Hydra groups and a new bound for the length of words

2013

Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups

2003

We prove by explicit construction that graph braid groups and most surface groups can be embedded in a natural way in right-angled Artin groups, and we point out some consequences of these embedding results. We also show that every right-angled Artin group can be embedded in a pure surface braid group. On the other hand, by generalising to right-angled Artin groups a result of Lyndon for free groups, we show that the Euler characteristic -1 surface group (given by the relation x^2y^2=z^2) never embeds in a right-angled Artin group.

About Vertex Mappings

2019

Summary In [6] partial graph mappings were formalized in the Mizar system [3]. Such mappings map some vertices and edges of a graph to another while preserving adjacency. While this general approach is appropriate for the general form of (multidi)graphs as introduced in [7], a more specialized version for graphs without parallel edges seems convenient. As such, partial vertex mappings preserving adjacency between the mapped verticed are formalized here.

A Series of Hadamard Designs with Large Automorphism Groups

2000

Abstract Whilst studying a certain symmetric (99, 49, 24)-design acted upon by a Frobenius group of order 21, it became clear that the design would be a member of an infinite series of symmetric (2q2 + 1, q2, (q2 − 1)/2)-designs for odd prime powers q. In this note, we present the definition of the series and give some information about the automorphism groups of its members.

On modified α-ϕ-fuzzy contractive mappings and an application to integral equations

2016

Abstract We introduce the notion of a modified α-ϕ-fuzzy contractive mapping and prove some results in fuzzy metric spaces for such kind of mappings. The theorems presented provide a generalization of some interesting results in the literature. Two examples and an application to integral equations are given to illustrate the usability of our theory.

ON SOME GENERALIZATION OF SMOOTHING PROBLEMS

2015

The paper deals with the generalized smoothing problem in abstract Hilbert spaces. This generalized problem involves particular cases such as the interpolating problem, the smoothing problem with weights, the smoothing problem with obstacles, the problem on splines in convex sets and others. The theorem on the existence and characterization of a solution of the generalized problem is proved. It is shown how the theorem gives already known theorems in special cases as well as some new results.

Shape optimization for Stokes problem with threshold slip boundary conditions

2017

This paper deals with shape optimization of systems governed by the Stokes flow with threshold slip boundary conditions. The stability of solutions to the state problem with respect to a class of domains is studied. For computational purposes the slip term and impermeability condition are handled by a regularization. To get a finite dimensional optimization problem, the optimized part of the boundary is described by B´ezier polynomials. Numerical examples illustrate the computational efficiency. peerReviewed