UNiON Scholar
UNiON Web Scholar iON AI About Scholar
110 scholarly results for math.GR
Scholar iON Academic Synthesis
The selected papers explore diverse applications of advanced mathematical concepts in biological and computational systems. Negadi (2016) and Sciarrino (2003) both investigate the genetic code through mathematical lenses, employing q-deformations and quantum groups respectively, to model genetic phenomena such as amino acid classification and genetic mutations. These studies highlight the potential of abstract mathematical frameworks to elucidate complex biological processes. Concurrently, Kang (2013) and McCarty (2019) expand on computational models, with Kang examining long-distance cellular automata for potential universality and McCarty extending the theory of differential similarity to higher dimensions for enhanced clustering algorithms. Collectively, this body of research underscores the cross-disciplinary significance of mathematical models in providing insights into both biological and computational complexities.
πŸŽ“ Deep dive with Scholar iON β†’
arxiv.org Β· scholarly article
Semi-phenomenological classification models of the genetic code(s) using q-deformed numbers
Tidjani Negadi
2016 arXiv Open Access
The mathematical concept of q-deformations, in particular the one of qnumbers, is used to study the genetic code(s). After considering two kinds of q-numbers, for comparison, a phenomenological classification scheme of the genetic code together with its numerous minor variants is, first, established. Next, numbers describing the presence of additional amino acids, such as Selenocysteine or/and Pyrrolysine, are also produced. Finally, a minimal number of amino acids, which could fit the small number of them which are thought to have been involved, at the origin of life on Earth, is found. All together, these results constitute our final semi-phenomenological model.
arxiv.org Β· scholarly article
From quantum groups to genetic mutations
Antonino Sciarrino
2003 arXiv Open Access
In the framework of the crystal basis model of the genetic code, where each codon is assigned to an irreducible representation of $U_{q \to 0}(sl(2) \oplus sl(2))$, single base mutation matrices are introduced. The strength of the mutation is assumed to depend on the "distance" between the codons. Preliminary general predictions of the model are compared with experimental data, with a satisfactory agreement.
arxiv.org Β· scholarly article
Investigation of Rule 73 as Case Study of Class 4 Long-Distance Cellular Automata
Lucas Kang
2013 arXiv Open Access
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been studied in particular due to its simple form and versatility. However, these dynamic computation systems possess evolutionary rules dependent on a neighborhood of adjacent cells, which limits their sampling radius and the environments that they can be used in. The purpose of this study was to explore the complex nature of one-dimensional CA in configurations other than that of the standard ECA. Namely, "long-distance cellular automata" (LDCA), a construct that had been described in the past, but never studied. I experimented with a class of LDCA that used spaced sample cells unlike ECA, and were described by the notation LDCA-x-y-n, where x and y represented the amount of spacing between the cell and its left and right neighbors, and n denoted the length of the initial tape for tapes of finite size. Some basic characteristics of ECA are explored in this paper, such as seemingly universal behavior, the prevalence of complexity with varying neighborhoods, and qualitative behavior as a function of x and y spacing. Focusing mainly on purely Class 4 behavior in LDCA-1-2, I found that Rule 73 could potentially be Turing universal through the emulation of a cyclic tag system, and revealed a connection between the mathematics of binary trees and Eulerian numbers that might provide insight into unsolved problems in both fields.
arxiv.org Β· scholarly article
Differential Similarity in Higher Dimensional Spaces: Theory and Applications
L. Thorne McCarty
2019 arXiv Open Access
This paper presents an extension and an elaboration of the theory of differential similarity, which was originally proposed in arXiv:1401.2411 [cs.LG]. The goal is to develop an algorithm for clustering and coding that combines a geometric model with a probabilistic model in a principled way. For simplicity, the geometric model in the earlier paper was restricted to the three-dimensional case. The present paper removes this restriction, and considers the full $n$-dimensional case. Although the mathematical model is the same, the strategies for computing solutions in the $n$-dimensional case are different, and one of the main purposes of this paper is to develop and analyze these strategies. Another main purpose is to devise techniques for estimating the parameters of the model from sample data, again in $n$ dimensions. We evaluate the solution strategies and the estimation techniques by applying them to two familiar real-world examples: the classical MNIST dataset and the CIFAR-10 dataset.
arxiv.org Β· scholarly article
On the Origin of Species of Self-Supervised Learning
Samuel Albanie; Erika Lu; Joao F. Henriques
2021 arXiv Open Access
In the quiet backwaters of cs.CV, cs.LG and stat.ML, a cornucopia of new learning systems is emerging from a primordial soup of mathematics-learning systems with no need for external supervision. To date, little thought has been given to how these self-supervised learners have sprung into being or the principles that govern their continuing diversification. After a period of deliberate study and dispassionate judgement during which each author set their Zoom virtual background to a separate Galapagos island, we now entertain no doubt that each of these learning machines are lineal descendants of some older and generally extinct species. We make five contributions: (1) We gather and catalogue row-major arrays of machine learning specimens, each exhibiting heritable discriminative features; (2) We document a mutation mechanism by which almost imperceptible changes are introduced to the genotype of new systems, but their phenotype (birdsong in the form of tweets and vestigial plumage such as press releases) communicates dramatic changes; (3) We propose a unifying theory of self-supervised machine evolution and compare to other unifying theories on standard unifying theory benchmarks, where we establish a new (and unifying) state of the art; (4) We discuss the importance of digital biodiversity, in light of the endearingly optimistic Paris Agreement.
arxiv.org Β· scholarly article
A Class of Deductive Theories that cannot be Deterministic: Classical and Quantum Physics are not deterministic
Iegor Reznikoff
2012 arXiv Open Access DOI: 10.1088/1742-6596/410/1/012052
The problem of the determinism of Quantum Mechanics has been a main one during the 20th century. At the same time, in the context of Logic and Set Theory, the importance of ancient paradoxes as well as the appearance of many new ones, has shed light on and deeply influenced the foundations of Mathematics and somehow of Physics. But, strangely, concerning Physics, a paradox which we call the Memory Paradox has remained yet undiscovered, despite its simplicity and remarkable consequences, mostly in Physics and surprisingly in classical Physics that appear to be non deterministic, contrary to the general belief since Newton, Laplace, etc.. The non determinism of Quantum Physics follows without any supplementary hypothesis. This paper extends a previous one (arXiv: 1203.2945v1 [physics.gen-ph] 13 Mar 2012).
arxiv.org Β· scholarly article
Superluminal Group Velocity of Neutrinos : Review, Development and Problems
Kazuyuki Fujii
2012 arXiv Open Access
The purpose of this paper is both to provide mathematical reinforcements to the paper [Mecozzi and Bellini : arXiv:1110.1253 [hep-ph]] by taking decoherence into consideration and to present some important problems related. We claim that neutrinos have superluminality as a latent possibility.
arxiv.org Β· scholarly article
Unobservable Potentials to Explain a Quantum Eraser and a Delayed-Choice Experiment
Masahito Morimoto
2017 arXiv Open Access DOI: 10.2528/PIERM17082201
We present a new explanation for a quantum eraser. Mathematical description of the traditional explanation needs quantum-superposition states. However, the phenomenon can be explained without quantum-superposition states by introducing unobservable potentials which can be identified as an indefinite metric vector. In addition, a delayed choice experiment can also be explained by the interference between the photons and unobservable potentials, which seems like an unreal long-range correlation beyond the causality.
arxiv.org Β· scholarly article
hep-th
Yang-Hui He; Vishnu Jejjala; Brent D. Nelson
2018 arXiv Open Access
We apply techniques in natural language processing, computational linguistics, and machine-learning to investigate papers in hep-th and four related sections of the arXiv: hep-ph, hep-lat, gr-qc, and math-ph. All of the titles of papers in each of these sections, from the inception of the arXiv until the end of 2017, are extracted and treated as a corpus which we use to train the neural network Word2Vec. A comparative study of common n-grams, linear syntactical identities, word cloud and word similarities is carried out. We find notable scientific and sociological differences between the fields. In conjunction with support vector machines, we also show that the syntactic structure of the titles in different sub-fields of high energy and mathematical physics are sufficiently different that a neural network can perform a binary classification of formal versus phenomenological sections with 87.1% accuracy, and can perform a finer five-fold classification across all sections with 65.1% accuracy.
arxiv.org Β· scholarly article
A General Equilibrium Theorem for the Economy of Giving
W. P. Weijland
2014 arXiv Open Access
In [1] we presented a model for transactions when goods are given away in the expectation of a later settlement. In settings where people keep track of their social accounts we were able to redefine concepts like account balance, yield curve and the law of diminishing returns. In this paper we establish a general equilibrium theorem, conjectured in [1], by developing sufficient conditions for any instance of the standard model (or Gift Economy Model) to have a unique equilibrium. The convergence to that equilibrium is exponential and for each pair of entities P and Q the total sum of yields from all mutual transactions is equal to zero. [1] W.P. Weijland, Mathematical Foundations for the Economy of Giving, ArXiv Categories: q-fin.GN, Report 1401.4664, 2014.