arXiv subjects

Alain Faisant

Publications and source records attributed to Alain Faisant.

7 recordsLinked to original sources

arXiv2026

Characteristic adjacency matrix associated with a hypergraph

We define a new matrix associated with a hypergraph. A study of this matrix is carried out, in particular the study of its spectrum, which shows the relevance of the construction. We demon- strate that this adjacency matrix is characterisitic of the hypergraph, that is to say, two isomorphic hypergraphs have similar matrices. Furthermore, starting from this matrix, we can reconstruct the hypergraph. Starting from this matrix, we introduce new graphs associated with the hypergraph.

math.CO↗

arXiv2026

Linear representation of groups associated to graphs

In this article, we introduce a group linear representation associated to a graph. We study this representation as well as the canonical decomposition of the associated module. A character study is conducted, demonstrating the relevance of this approach to graph theory. We also develop the links that exist between algebra and graphs, particularly in the language of representations.

math.RT↗

arXiv2024

About Berge-F\"uredi's conjecture on the chromatic index of hypergraphs

We show that the chromatic index of a hypergraph $\mathcal{H}$ satisfies Berge-F\"uredi conjectured bound $\mathrm{q}(\mathcal{H})\le \Delta([\mathcal{H}]_2)+1$ under certain hypotheses on the antirank $\mathrm{ar}(\mathcal{H})$ or on the maximum degree $\Delta(\mathcal{H})$. This provides sharp information in connection with Erd\H{o}s-Faber-Lov\'asz Conjecture which deals with the coloring of a family of cliques that intersect pairwise in at most one vertex.

math.CO↗

arXiv2024

The Berge-F\"uredi conjecture on the chromatic index of hypergraphs with large hyperedges

This paper is concerned with two conjectures which are intimately related. The first is a generalization to hypergraphs of Vizing's Theorem on the chromatic index of a graph and the second is the well-known conjecture of Erd\H{o}s, Faber and Lov\'asz which deals with the problem of coloring a family of cliques intersecting in at most one vertex. We are led to study a special class of uniform and linear hypergraphs for which a number of properties are established.

math.CO↗

arXiv2019

Additive Complements for a given Asymptotic Density

{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that the sumset $A+B:=\{a+b~;a\in A,b\in B\}$ has given asymptotic density. We solve the particular case in which $B$ is a given finite subset of $\mathbb{N}$ and also the case when $B=A$ ; in the later case, we generalize our result to $kA:=\{x_1+\cdots+x_k: x_i\in A, i=1,\dots,k\}$ for an integer $k\geq2.$

math.NT↗

arXiv2019

On the Padovan sequence

The aim of this article is to give some properties of the so-called Padovan sequence $(T_n)_{n \ge 0}$ defined by $$ T_{n+3}=T_{n+1}+T_n \forall n \in \mathbb{N}, T_1=T_2=T_3=1$$ that is divisibility properties, periods, identities.

math.NT↗

arXiv2010

Electrically induced tunable cohesion in granular systems

Experimental observations of confined granular materials in the presence of an electric field that induces cohesive forces are reported. The angle of repose is found to increase with the cohesive force. A theoretical model for the stability of a granular heap, including both the effect of the sidewalls and cohesion is proposed. A good agreement between this model and the experimental results is found. The steady-state flow angle is practically unaffected by the electric field except for high field strengths and low flow rates.

cond-mat.other↗