Searcharxiv⌕ Search

arXiv subjects

Marius Buliga

Publications and source records attributed to Marius Buliga.

At least 19 recordsLinked to original sources
arXiv2026

Comments on Symplectic bipotentials arXiv:2410.23122

This is a reaction to the article Symplectic bipotentials, in published form [2] Harakeh M, Ban M, de Saxce G. Symplectic bipotentials. Mathematics and Mechanics of Solids. 2026;0(0) doi:10.1177/10812865251413554, and in preprint form [1] arXiv:2410.23122v1. We give evidence that most of the content of the article [2] is already covered in previous works, partially cited like [7] arXiv:0810.1419 [math.FA], or uncited, like [10] arXiv:1902.04598 [math-ph], [3] arXiv:2304.14158 [math-ph], which already introduced and studied symplectic bipotentials. These comments also apply to the conference paper version of [1] arXiv:2410.23122v1, namely to the article Harakeh, M., Ban, M., de Saxce, G. (2026). Symplectic Bipotentials for the Dynamics of Dissipative Systems with Non Associated Constitutive Laws. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2025. Lecture Notes in Computer Science, vol 16034. Springer, Cham. doi:10.1007/978-3-032-03921-7_31 .

math.SG↗
arXiv2023

chemSKI with tokens: world building and economy in the SKI universe

chemSKI with tokens is a confluent graph rewrite system where all rewrites are local, which moreover can be used to do SKI calculus reductions. The graph rewrites of chemSKI are made conservative by the use of tokens. We thus achieve several goals: conservative rewrites in a chemical style, a solution to the problem of new edge names in a distributed, decentralized graphical reduction and a new estimation of the cost of a combinatory calculus computation. This formalism can be used either as an artificial chemistry or as a model of a virtual decentralized machine which performs only local reductions. A programs repository and the same article with simulations are available at github at https://mbuliga.github.io/chemski/chemski-with-tokens.html

cs.AI↗
arXiv2023

Dissipation and the information content of the deviation from hamiltonian dynamics

We explain a dissipative version of hamiltonian mechanics, based on the information content of the deviation from hamiltonian dynamics. From this formulation we deduce minimal dissipation principles, dynamical inclusions, or constrained evolution with hamiltonian drift reformulations. Among applications we recover a dynamics generalization of Mielke et al quasistatic rate-independent processes. This article gives a clear and unitary presentation of the theory of hamiltonian inclusions with convex dissipation or symplectic Brezis-Ekeland-Nayroles principle, presented under various conventions first in arXiv:0810.1419, then in arXiv:1408.3102 and, for the appearance of bipotentials in relation to the symplectic duality, in arXiv:1902.04598v1.

math-ph↗
arXiv2021

COLIN implies LIN for emergent algebras

Emergent algebras, first time introduced in arXiv:0907.1520 , are families of quasigroup operations indexed by a commutative group, which satisfy some algebraic relations and also topological (convergence and continuity) relations. Besides sub-riemannian geometry arXiv:math/0608536, they appear as a semantics of a family of graph-rewrite systems related to interaction combinators arXiv:2007.10288, or lambda calculus arXiv:1305.5786 . In arXiv:1807.02058 there is a lambda calculus version of emergent algebras. In this article we prove that for emergent algebras the condition (COLIN), or right-distributivity for emergent algebras, implies (LIN), or left-distributivity for emergent algebras. It means that any emergent algebra which is right-distributive has to come from a commutative group endowed with a family of dilations. This is surprising, because there are many examples of emergent algebras which satisfy (LIN), but not (COLIN), namely those who are associated to non-commutative conical groups, in particular to non-commutative Carnot groups.

math.GR↗
arXiv2020

Graph rewrites, from graphic lambda calculus, to chemlambda, to directed interaction combinators

Here I report about the modifications of and relations between graphic lambda calculus, various formalisms which appeared under the name chemlambda and a version of directed interaction combinators. This is part of the study and experiments with the artificial chemistry chemlambda and the relations with lambda calculus or interaction combinators, as described in arXiv:2003.14332 and available from the entry page at https://chemlambda.github.io/index.html

cs.LO↗
arXiv2020

Artificial chemistry experiments with chemlambda, lambda calculus, interaction combinators

Given a graph rewrite system, a graph G is a quine graph if it has a non-void maximal collection of non-conflicting matches of left patterns of graphs rewrites, such that after the parallel application of the rewrites we obtain a graph isomorphic with G. Such graphs exhibit a metabolism, they can multiply or they can die, when reduced by a random rewriting algorithm. These are introductory notes to the pages of artificial chemistry experiments with chemlambda, lambda calculus or interaction combinators, available from the entry page https://chemlambda.github.io/index.html . The experiments are bundled into pages, all of them based on a library of programs, on a database which contains hundreds of graphs and on a database of about 150 pages of text comments and a collection of more than 200 animations, most of them which can be re-done live, via the programs. There are links to public repositories of other contributors to these experiments, with versions of these programs in python, haskell, awk or javascript.

cs.AI↗
arXiv2018

Molecular computers

We propose the chemlambda artificial chemistry, whose behavior strongly suggests that real molecules which embed Interaction Nets patterns and real chemical reactions which resemble Interaction Nets graph rewrites could be a realistic path towards molecular computers, in the sense explained in the article.

cs.ET↗
arXiv2018

The em-convex rewrite system

We introduce and study em (or "emergent"), a lambda calculus style rewrite system inspired from dilations structures in metric geometry. Then we add a new axiom (convex) and explore its consequences. Although (convex) forces commutativity of the infinitesimal operations, Theorems 6.2, 8.9 and Proposition 8.7 appear as a lambda calculus style version of Gleason and Montgomery-Zippin solution to the Hilbert 5th problem.

cs.LO↗
arXiv2014

A symplectic Brezis-Ekeland-Nayroles principle

We propose a modification of the hamiltonian formalism which can be used for dissipative systems. This work continues arXiv:0810.1419 and advances by the introduction of a symplectic version of the Brezis-Ekeland-Nayroles principle [Brezis Ekeland 1976] [Nayroles 1976]. As an application we show how standard plasticity can be treated in our formalism.

math-ph↗
arXiv2014

Zipper logic

Zipper logic is a graph rewrite system, consisting in only local rewrites on a class of zipper graphs. Connections with the chemlambda artificial chemistry and with knot diagrammatics based computation are explored in the article.

math.CO↗
arXiv2014

Chemlambda, universality and self-multiplication

We present chemlambda (or the chemical concrete machine), an artificial chemistry with the following properties: (a) is Turing complete, (b) has a model of decentralized, distributed computing associated to it, (c) works at the level of individual (artificial) molecules, subject of reversible, but otherwise deterministic interactions with a small number of enzymes, (d) encodes information in the geometrical structure of the molecules and not in their numbers, (e) all interactions are purely local in space and time. This is part of a larger project to create computing, artificial chemistry and artificial life in a distributed context, using topological and graphical languages.

cs.AI↗
arXiv2013

Chemical concrete machine

The chemical concrete machine is a graph rewriting system which uses only local moves (rewrites), seen as chemical reactions involving molecules which are graphs made up by 4 trivalent nodes. It is Turing complete, therefore it might be used as a model of computation in algorithmic chemistry.

cs.FL↗
arXiv2013

Graphic lambda calculus

We introduce and study graphic lambda calculus, a visual language which can be used for representing untyped lambda calculus, but it can also be used for computations in emergent algebras or for representing Reidemeister moves of locally planar tangle diagrams.

cs.LO↗
arXiv2013

Origin of emergent algebras

This is an expository article concerning the last section "Why is the tangent space a group?" (section 8) of the article by A. Bellaiche, The tangent space in sub-riemannian geometry, from the viewpoint of emergent algebras.

math.MG↗
arXiv2013

Geometric Ruzsa triangle inequality in metric spaces with dilations

The Appendix of the article arXiv:1212.5056 [math.CO] "On growth in an abstract plane" by Nick Gill, H. A. Helfgott, Misha Rudnev, contains a general "geometric Ruzsa triangle inequality" in a Desarguesian projective plane. The purpose of this note is to give a similar inequality for metric spaces with dilations, that is in the absence of an algebraic or incidence structure.

math.CO↗