WorldCat Identities

Hennecart, François

Overview
Works: 13 works in 28 publications in 2 languages and 426 library holdings
Roles: Other, Author, Opponent, Thesis advisor
Publication Timeline
.
Most widely held works by François Hennecart
Éléments de théorie des graphes by Alain Bretto( )

14 editions published between 2012 and 2018 in French and held by 399 WorldCat member libraries worldwide

La 4e de couverture indique : "Cet ouvrage est une introduction à la théorie des graphes. La plupart des notions élémentaires et classiques y sont introduites selon une approche originale, précise et rigoureuse. Ainsi les résultats énoncés font l'objet, dans leur quasi-totalité, de démonstrations détaillées. L'aspect topologique et l'aspect algébrique, derniers avatars de cette théorie, ont été développés de manière approfondie. La variété des thèmes abordés a pour objectif de conduire le lecteur à appréhender les graphes dans leur plus grande diversité afin d'en percevoir la puissance en tant qu'outil mathématique. L'accent a également été mis sur l'algorithmique des graphes, qui se prêtent particulièrement bien aux structures de données et à la programmation. Cette deuxième édition propose une présentation plus complète des graphes planaires et de la théorie spectrale. On y trouve aussi un nouveau chapitre sur les graphes aléatoires et quelques éléments d'analyse sur graphes. Ce livre peut être d'usage courant pour les étudiants en informatique et en mathématiques du niveau licence mais il s'adresse également aux étudiants de master ainsi qu'aux élèves ingénieurs. Il pourra aussi être utile à des étudiants doctorants et à des chercheurs confirmés voulant en savoir plus sur ce domaine."
Éléments de théorie des graphes by Alain Bretto( )

1 edition published in 2012 in French and held by 12 WorldCat member libraries worldwide

Contribution à la théorie additive des nombres : quelques questions sur les bases d'entiers by François Hennecart( Book )

2 editions published in 1991 in French and held by 2 WorldCat member libraries worldwide

UNE SUITE D'ENTIERS A EST UNE BASE, SI TOUT ENTIER EST SOMME D'UN NOMBRE UNIFORMEMENT BORNE D'ELEMENTS DE A. ON ETABLIT ET ON ILLUSTRE UN CRITERE, PERMETTANT DE RECONNAITRE QU'UNE APPLICATION DE N DANS N NE TRANSFORME PAS TOUTE BASE EN BASE. ON MONTRE EGALEMENT QU'IL EXISTE UNE SUITE C, QUI N'EST PAS UNE BASE, TELLE QUE TOUT ENTIER EST SOMME DE QUATRE CARRES D'ELEMENTS DE C, CE QUI AMELIORE DE FACON DEFINITIVE UN RESULTAT ANTERIEUR DE J.-M. DESHOUILLERS, P. ERDOS ET A. SARKOZY
A note on the size of the set $$\varvecA^2+A}$$ A2+A by Norbert Hegyvári( )

1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide

A study concerning the positive semi-definite property for similarity matrices and for doubly stochastic matrices with some applications by Rafic Nader( )

2 editions published in 2019 in English and held by 2 WorldCat member libraries worldwide

Matrix theory has shown its importance by its wide range of applications in different fields such as statistics, machine learning, economics and signal processing. This thesis concerns three main axis related to two fundamental objects of study in matrix theory and that arise naturally in many applications, that are positive semi-definite matrices and doubly stochastic matrices.One concept which stems naturally from machine learning area and is related to the positive semi-definite property, is the one of similarity matrices. In fact, similarity matrices that are positive semi-definite are of particular importance because of their ability to define metric distances. This thesis will explore the latter desirable structure for a list of similarity matrices found in the literature. Moreover, we present new results concerning the strictly positive definite and the three positive semi-definite properties of particular similarity matrices. A detailed discussion of the many applications of all these properties in various fields is also established.On the other hand, an interesting research field in matrix analysis involves the study of roots of stochastic matrices which is important in Markov chain models in finance and healthcare. We extend the analysis of this problem to positive semi-definite doubly stochastic matrices.Our contributions include some geometrical properties of the set of all positive semi-definite doubly stochastic matrices of order n with nonnegative pth roots for a given integer p. We also present methods for finding classes of positive semi-definite doubly stochastic matrices that have doubly stochastic pth roots for all p, by making use of the theory of M-Matrices and the symmetric doubly stochastic inverse eigenvalue problem (SDIEP), which is also of independent interest.In the context of the SDIEP, which is the problem of characterising those lists of real numbers which are realisable as the spectrum of some symmetric doubly stochastic matrix, we present some new results along this line. In particular, we propose to use a recursive method on constructing doubly stochastic matrices from smaller size matrices with known spectra to obtain new independent sufficient conditions for SDIEP. Finally, we focus our attention on the realizability by a symmetric doubly stochastic matrix of normalised Suleimanova spectra which is a normalized variant of the spectra introduced by Suleimanova. In particular, we prove that such spectra is not always realizable for odd orders and we construct three families of sufficient conditions that make a refinement for previously known sufficient conditions for SDIEP in the particular case of normalized Suleimanova spectra
On Small Sumsets in (ℤ/2ℤ) n by Jean-Marc Deshouillers( )

1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide

Ensembles de petite somme et ensembles de Sidon, étude de deux extrêmes by Robin Riblet( )

1 edition published in 2021 in French and held by 1 WorldCat member library worldwide

Our project lies in the field of additive combinatorics. More precisely, we seek the maximal size of a progression free subset of a finite group G, meaning a subset with no three distinct elements of the form a, a+d, a+2d (called a 3AP for 3 arithmetic progression). A 3AP is a simple and natural pattern that we expect to find in a 'large enough' set and we shall try to precise what 'large enough' means here. Trying to determine the maximal size of a progression free set is now a classical problem in additive combinatorics, on which many of the best experts have worked. There are two different aspects in this problem : to determine a minimal size for A which assures the existence of 3AP in A, this gives an upper bound for the maximal size of a progression free set; to build some large progression free sets, this gives a lower bound for this maximal size. We will insist on the constructive part in the context of groups Z_q^n with small q. We shall also try to adapt a construction by Ruzsa to this context. The progression of this work should be from some combinatorial constructions, allowing numerical approach, to more theoretical concepts
Domaine de méromorphie maximal et frontière naturelle de produits eulériens uniformes d'une ou de plusieurs variables by Ludovic Delabarre( )

1 edition published in 2010 in French and held by 1 WorldCat member library worldwide

The aim of this thesis is to determine the natural boundary of meromorphy (when it exists) of an Euler product of n variables associated to a polynomial h \in \mathbf{Z } [X_1....,X_,n] satisfying an hypothesis of analytic regularity. Precisely it consists in finding the boundary of a maximal domain on which a meromorphic extension exists. We present in this thesis some methods which permit to extend in the multivariable case, under an hypothesis of analytic regularity which is mostly satisfied, the well-know result of Estermann concerning the maximal domain of meromorphy of an one variable Euler product \prod_{p}h(p^{-s}) associated to a polynomial h with integral coefficients (such that Sh(0)=1S). We also precise the sense which we can give to the concept of "natural boundary" with regard to the real or complex dimension of a possible continuation beyond this boundary. As an application, we determine the natural boundary of a class of Euler products associated to a projective toric variety. A second application consists in the determination of the natural boundary of a class of Euler products of the form \prod_{p}h(p^{-s_l },...,p^{-s_n},p^{-c }) where c is an integer (positive or negative). In particular we solve a problem of N. Kurokawa and H. Ochiai concerning the natural boundary of meromorphy of the multivariable lgusa zeta function Z^{\textrm{ring} }(s_1,\dots,s_n; \mathbf{Z}[T,T^{-1}])
Some questions in combinatorial and elementary number theory by Salvatore Tringali( )

1 edition published in 2013 in English and held by 1 WorldCat member library worldwide

This thesis is divided into two parts. Part I is about additive combinatorics. Part II deals with questions in elementary number theory. In Chapter 1, we generalize the Davenport transform to prove that if si S\mathbb A=(A, +)S is acancellative semigroup (either abelian or not) and SX, YS are non-empty subsets of SAS such that the subsemigroup generated by SYS is abelian, then SS|X+Y|\gc\min(\gamma(Y, |X|+|Y|-I)SS, where for SZ\subsetcq AS we let S\gamma(Z):=\sup_{z_0\in Z^\times}\in f_(z_0\nc z\inZ) (vm ord)(z-z_0)S. This implies an extension of Chowla's and Pillai's theorems for cyclic groups and a stronger version of an addition theorem by Hamidoune and Karolyi for arbitrary groups. In Chapter 2, we show that if S(A, +) is a cancellative semigroup and SX, Y\subsetcq AS then SS|X+Y|\gc\min(\gammaX+Y), |X|+|Y|-I)SS. This gives a generalization of Kemperman's inequality for torsion free groups and a stronger version of the Hamidoune-Karolyi theorem. In Chapter 3, we generalize results by Freiman et al. by proving that if S(A,\ctlot)S is a linearly orderable semigroup and SSS is a finite subset of SAS generating a non-abelian subsemigroup, then S|S^2-\gc3|S|-2S. In Chapter 4, we prove results related to conjecture by Gyory and Smyth on the sets SR_k^\pm(a,b)S of all positive integers SnS such that Sn^kS divides Sa^a \pmb^nS for fixed integers SaS, SbS and SkS with Sk\gc3S, S|ab|\gc2Set S\gcd(a,b) = 1S. In particular, we show that SR_k^pm(a,b)S is finite if Sk\gc\max(|a|.|b|)S. In Chapter 5, we consider a question on primes and divisibility somchow related to Znam's problem and the Agoh-Giuga conjecture
La fonction de Brakemeier dans le problème d'Erdős-Ginzburg-Ziv by François Hennecart( )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

Sums of powers : an arithmetic refinement to the probabilistic model of Erdös and Rényi by Jean-Marc Deshouillers( )

1 edition published in 1998 in English and held by 1 WorldCat member library worldwide

Une propriété arithmétique des bases additives : un critère de non-base by François Hennecart( )

1 edition published in 2003 in French and held by 1 WorldCat member library worldwide

Sums and differences of finite sets by Katalin Gyarmati( )

1 edition published in 2007 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.71 (from 0.70 for Éléments ... to 0.99 for Éléments ...)

Éléments de théorie des graphes Éléments de théorie des graphes
Covers
Éléments de théorie des graphes
Languages
French (20)

English (8)