Related papers: Blurred constitutive laws and bipotential convex c…
This is a first paper in convex analysis dedicated to the bipotential theory, based on an extension of Fenchel's inequality. Introduced by the second author, bipotentials lead to a succesful new treatment of the constitutive laws of some…
In Mechanics, the theory of standard materials is a well-known application of Convex Analysis. However, the so-called non-associated constitutive laws cannot be cast in the mould of the standard materials. From the mathematical viewpoint, a…
The forward problems of pattern formation have been greatly empowered by extensive theoretical studies and simulations, however, the inverse problem is less well understood. It remains unclear how accurately one can use images of pattern…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
Constitutive relations close the balance laws of continuum mechanics and serves as the surrogate for a material in the design and engineering process. The problem of obtaining the constitutive relations is an indirect inverse problem where…
We show a surprising connexion between a property of the inf convolution of a family of convex lower semicontinuous functions and the fact that the intersection of maximal cyclically monotone graphs is the critical set of a bipotential. We…
Twisting and bending deformations are crucial to the biological functions of microfilaments such as DNA molecules. Although continuum-rod models have emerged as efficient tools to describe the nonlinear dynamics of these deformations, a…
Inspired by the algorithm of Berga and de Saxce for solving the discretisation in time of the evolution problem for an implicit standard material, we propose a general variational formulation in terms of bipotentials.
We propose a method to accurately and efficiently identify the constitutive behavior of complex materials through full-field observations. We formulate the problem of inferring constitutive relations from experiments as an indirect inverse…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
This paper reviews some recent applications of the theory of the compensated convex transforms or of the proximity hull as developed by the authors to image processing and shape interrogation with special attention given to the Hausdorff…
Probabilistic embeddings have proven useful for capturing polysemous word meanings, as well as ambiguity in image matching. In this paper, we study the advantages of probabilistic embeddings in a cross-modal setting (i.e., text and images),…
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these…
By designating vertices with variables, a simple undirected graph can be augmented to have an associated representing rational function in two variables taking the complex bi-upper halfplane to itself. We give relations between representing…
In this article, we apply the concept of bipolar fuzzy sets to hypergraphs and investigate some properties of bipolar fuzzy hypergraphs. We introduce the notion of $A-$ tempered bipolar fuzzy hypergraphs and present some of their…
In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices. In this article, we describe how the idea of unfolding a…