scholarly journals Chamber Structure For Double Hurwitz Numbers

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Renzo Cavalieri ◽  
Paul JOHNSON ◽  
Hannah Markwig
Keyword(s):  
Main Tool ◽  
Hyperplane Arrangements ◽  
Lattice Points ◽  
Piecewise Polynomial ◽  
Nous Proposons ◽  
Hurwitz Numbers ◽  
Wall Crossing ◽  
Piecewise Polynomial Functions ◽  
International Audience ◽  
Branch Divisor

International audience Double Hurwitz numbers count covers of the sphere by genus $g$ curves with assigned ramification profiles over $0$ and $\infty$, and simple ramification over a fixed branch divisor. Goulden, Jackson and Vakil (2005) have shown double Hurwitz numbers are piecewise polynomial in the orders of ramification, and Shadrin, Shapiro and Vainshtein (2008) have determined the chamber structure and wall crossing formulas for $g=0$. We provide new proofs of these results, and extend them in several directions. Most importantly we prove wall crossing formulas for all genera. The main tool is the authors' previous work expressing double Hurwitz number as a sum over labelled graphs. We identify the labels of the graphs with lattice points in the chambers of certain hyperplane arrangements, which give rise to piecewise polynomial functions. Our understanding of the wall crossing for these functions builds on the work of Varchenko (1987). This approach to wall crossing appears novel, and may be of broader interest. This extended abstract is based on a new preprint by the authors. Les nombres de Hurwitz doubles dénombrent les revêtements de la sphère par une surface de genre $g$ avec ramifications prescrites en $0$ et $\infty$, et dont les autres valeurs critiques sont non dégénérées et fixées. Goulden, Jackson et Vakil (2005) ont prouvé que les nombres de Hurwitz doubles sont polynomiaux par morceaux en l'ordre des ramifications prescrites, et Shadrin, Shapiro et Vainshtein (2008) ont déterminé la structure des chambres et ont établis des formules pour traverser les murs en genre $0$. Nous proposons des nouvelles preuves de ces résultats, et les généralisons dans plusieurs directions. En particulier, nous prouvons des formules pour traverser les murs en tout genre. L'outil principal est le précédent travail des auteurs exprimant les nombres de Hurwitz doubles comme somme de graphes étiquetés. Nous identifions les étiquetages avec les points entiers à l'intérieur d'une chambre d'un arrangement d'hyperplans, qui sont connu pour donner une fonction polynomiale par morceaux. Notre étude des formules pour traverser les murs de ces fonctions se base sur un travail antérieur de Varchenko (1987). Cette approche paraît nouvelle, et peut être d'un large intérêt. Ce résumé élargi se base sur un papier nouveau des auteurs.

scholarly journals An Edge-Signed Generalization of Chordal Graphs, Free Multiplicities on Braid Arrangements, and Their Characterizations

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Takuro Abe ◽  
Koji Nuida ◽  
Yasuhide Numata
Keyword(s):  
Special Kind ◽  
Chordal Graph ◽  
Hyperplane Arrangements ◽  
Chordal Graphs ◽  
Nous Proposons ◽  
Signed Graphs ◽  
International Audience ◽  
Perfect Elimination Ordering

International audience In this article, we propose a generalization of the notion of chordal graphs to signed graphs, which is based on the existence of a perfect elimination ordering for a chordal graph. We give a special kind of filtrations of the generalized chordal graphs, and show a characterization of those graphs. Moreover, we also describe a relation between signed graphs and a certain class of multiarrangements of hyperplanes, and show a characterization of free multiarrangements in that class in terms of the generalized chordal graphs, which generalizes a well-known result by Stanley on free hyperplane arrangements. Finally, we give a remark on a relation of our results with a recent conjecture by Athanasiadis on freeness characterization for another class of hyperplane arrangements. Dans cet article, nous proposons une généralisation de la notion des graphes triangulés à graphes signés, qui est basée sur l'existence d'un ordre d'élimination simplicial à un graphe triangulé. Nous donnons un genre spécial de filtrations des graphes triangulés généralisés, et montrons une caractérisation de ces graphes. De plus, nous décrivons aussi une relation entre graphes signés et une certaine classe de multicompositions d'hyperplans, et montrons une caractérisation de multicompositions libres dans cette classe en termes des graphes triangulés généralisés, qui généralise un résultat célèbre de Stanley sur compositions libres d'hyperplans. Finalement, nous donnons une remarque sur une relation de nos résultats avec une conjecture récente d'Athanasiadis sur une caractérisation du freeness d'une autre classe de compositions d'hyperplans.

scholarly journals Splines, lattice points, and (arithmetic) matroids

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Matthias Lenz
Keyword(s):  
Differential Operator ◽  
Differential Operators ◽  
Hilbert Series ◽  
Tutte Polynomial ◽  
Lattice Points ◽  
Vector Spaces ◽  
Piecewise Polynomial ◽  
Finite Dimensional ◽  
International Audience ◽  
Homogeneous Vector

International audience Let $X$ be a $(d \times N)$-matrix. We consider the variable polytope $\Pi_X(u) = \left\{ w \geq 0 : Xw = u \right\}$. It is known that the function $T_X$ that assigns to a parameter $u \in \mathbb{R}^N$ the volume of the polytope $\Pi_X(u)$ is piecewise polynomial. Formulas of Khovanskii-Pukhlikov and Brion-Vergne imply that the number of lattice points in $\Pi_X(u)$ can be obtained by applying a certain differential operator to the function $T_X$. In this extended abstract we slightly improve the formulas of Khovanskii-Pukhlikov and Brion-Vergne and we study the space of differential operators that are relevant for $T_X$ (ıe operators that do not annihilate $T_X$) and the space of nice differential operators (ıe operators that leave $T_X$ continuous). These two spaces are finite-dimensional homogeneous vector spaces and their Hilbert series are evaluations of the Tutte polynomial of the (arithmetic) matroid defined by $X$. Soit $X$ une matrice $(d \times N)$. Nous considérons le polytope variable $\Pi_X(u) = \left\{ w \geq 0 : Xw = u \right\}$. Il est connu que la fonction $T_X$ qui attribue à un paramètre $u$ le volume du polytope $\Pi_X(u)$ est polynomiale par morceaux. Des formules de Khovanskii-Pukhlikov et de Brion-Vergne impliquent que le nombre de points de réseau dans $\Pi_X(u)$ peut être obtenu en appliquant un certain opérateur différentiel à la fonction $T_X$. Dans ce résumé élargi nous améliorons un peu les formules de Khovanskii-Pukhlikov et de Brion-Vergne et nous étudions l’espaced’opérateurs différentiels qui sont importants pour $T_X$ (c’est-à-dire les opérateurs qui n’annulent pas $T_X$) et l’espace d’opérateurs différentiels bons (c’est-à-dire les opérateurs qui laissent $T_X$ continue). Ces deux espaces sont espaces vectoriels homogène de dimension finie et leurs séries de Hilbert sont des évaluations du polynôme de Tutte du matroïde (arithmétique) défini par $X$.

Spline Based Design of Cam Contours for Improved Dynamic Performance

1993 ◽  
Author(s):  
Holly K. Ault ◽  
James C. Wilkinson
Keyword(s):  
Dynamic Performance ◽  
Integrated Design ◽  
Polynomial Functions ◽  
Piecewise Polynomial ◽  
Cam Design ◽  
Piecewise Polynomial Functions ◽  
Cam Follower ◽  
Cam Profile ◽  
Pitch Curve ◽  
Design And Manufacture

Abstract A method for the integrated design and manufacture of radial plate cams is discussed. Currently, a cam-follower system is designed by specifying constraints on the motion of the follower. The physical cam contour or cam pitch curve are not mathematically defined. The cam is manufactured from the discretized follower motion program. A new method for cam design is proposed which will produce a smooth, mathematically defined cam pitch curve while maintaining the proper constraints on the follower motion. Piecewise polynomial functions in the form of rational and/or non-rational splines may be used. Cams will be manufactured using smoothed profiles and tested for improved dynamic performance. The results of initial investigations of cam profile design for this research are presented.

scholarly journals Hermite Type Spline Spaces over Rectangular Meshes with Complex Topological Structures

2017 ◽  
Vol 21 (3) ◽  
pp. 835-866 ◽  
Author(s):  
Meng Wu ◽  
Bernard Mourrain ◽  
André Galligo ◽  
Boniface Nkonga
Keyword(s):  
Isogeometric Analysis ◽  
Convergence Rates ◽  
Approximation Order ◽  
Basis Functions ◽  
Physical Domain ◽  
Piecewise Polynomial ◽  
Numerical Convergence ◽  
Rectangular Mesh ◽  
Piecewise Polynomial Functions ◽  
Potential Applications

AbstractMotivated by the magneto hydrodynamic (MHD) simulation for Tokamaks with Isogeometric analysis, we present splines defined over a rectangular mesh with a complex topological structure, i.e., with extraordinary vertices. These splines are piecewise polynomial functions of bi-degree (d,d) and parameter continuity. And we compute their dimension and exhibit basis functions called Hermite bases for bicubic spline spaces. We investigate their potential applications for solving partial differential equations (PDEs) over a physical domain in the framework of Isogeometric analysis. For instance, we analyze the property of approximation of these spline spaces for the L2-norm; we show that the optimal approximation order and numerical convergence rates are reached by setting a proper parameterization, although the fact that the basis functions are singular at extraordinary vertices.

scholarly journals Contribution to image restoration using a neural network model

2002 ◽  
Vol Volume 1, 2002 ◽  
Author(s):  
Karim Achour ◽  
Nadia Zenati ◽  
Oualid Djekoune
Keyword(s):  
Neural Network ◽  
Image Restoration ◽  
Network Model ◽  
Neural Network Model ◽  
Hopfield Neural Network ◽  
Optimization Method ◽  
Nous Proposons ◽  
International Audience ◽  
High Level

International audience The reduction of the blur and the noise is an important task in image processing. Indeed, these two types of degradation are some undesirable components during some high level treatments. In this paper, we propose an optimization method based on neural network model for the regularized image restoration. We used in this application a modified Hopfield neural network. We propose two algorithms using the modified Hopfield neural network with two updating modes : the algorithm with a sequential updates and the algorithm with the n-simultaneous updates. The quality of the obtained result attests the efficiency of the proposed method when applied on several images degraded with blur and noise. La réduction du bruit et du flou est une tâche très importante en traitement d'images. En effet, ces deux types de dégradations sont des composantes indésirables lors des traitements de haut niveau. Dans cet article, nous proposons une méthode d'optimisation basée sur les réseaux de neurones pour résoudre le problème de restauration d'images floues-bruitées. Le réseau de neurones utilisé est le réseau de « Hopfield ». Nous proposons deux algorithmes utilisant deux modes de mise à jour: Un algorithme avec un mode de mise à jour séquentiel et un algorithme avec un mode de mise à jour n-simultanée. L'efficacité de la méthode mise en œuvre a été testée sur divers types d'images dégradées.

The Pierce-Birkhoff Conjecture for Curves

1992 ◽  
Vol 44 (6) ◽  
pp. 1262-1271 ◽  
Author(s):  
Murray Marshall
Keyword(s):  
Real Closed Field ◽  
Noetherian Rings ◽  
Closed Field ◽  
Polynomial Functions ◽  
Piecewise Polynomial ◽  
Algebraic Set ◽  
Dedekind Domains ◽  
Piecewise Polynomial Functions ◽  
Relative Case

AbstractThe results obtained extend Madden’s result for Dedekind domains to more general types of 1-dimensional Noetherian rings. In particular, these results apply to piecewise polynomial functions t:C → R where R is a real closed field and C ⊆ Rn is a closed 1-dimensional semi-algebraic set, and also to the associated “relative” case where t, C are defined over some subfield K ⊆ R.

Advanced Zig-Zag Beam Theories for Sandwich Structures Analyses

2018 ◽  
Author(s):  
Matteo Filippi ◽  
Erasmo Carrera
Keyword(s):  
Sandwich Structures ◽  
Higher Order ◽  
Polynomial Functions ◽  
Piecewise Polynomial ◽  
Displacement Fields ◽  
New Class ◽  
Dynamic Analyses ◽  
Piecewise Polynomial Functions ◽  
Carrera Unified Formulation ◽  
Beam Theories

This work aims at evaluating the capabilities of several higher-order beam formulations for stress and dynamic analyses of layered sandwich structures. The structural models are conceived within the framework of the Carrera Unified Formulation (CUF) that allows one to generate (and compare) an infinite number of displacement fields. The number and the type of functions that are selected to generate the kinematic expansions are input parameters of the problem. Besides the well-known Taylor- and Lagrange-type expansions, great attention is paid to a new class of advanced higher-order zig-zag theories, which are written as combinations of continuous piecewise polynomial functions. Numerical simulations are performed on laminated and sandwich beams with very low length-to-depth ratio values. Also, structures with soft layers made of viscoelastic materials are considered to investigate the different dissipation mechanisms.

scholarly journals On the integral representation of the endomorphisms of Mikuśinski's operator field

1971 ◽  
Vol 17 (4) ◽  
pp. 351-367 ◽  
Author(s):  
András Bleyer
Keyword(s):  
Integral Representation ◽  
Polynomial Functions ◽  
Piecewise Polynomial ◽  
Operator Field ◽  
Piecewise Polynomial Functions

We proved in (1) that every continuous endomorphism can be generated on a subring of the field M. More precisely, the ring H of piecewise polynomial functions has the property that every isomorphism from H into M, continuous in the sequential topology of H, can be extended to a continuous endomorphism of M where the notion of continuity in M is the usual sequential one.

Sign in / Sign up

Export Citation Format

Share Document