相关论文: Genetic algorithms and the Andrews-Curtis conjectu…

Sequential Recommender Systems (SRSs) have demonstrated remarkable effectiveness in capturing users' evolving preferences. However, their inherent complexity as "black box" models poses significant challenges for explainability. This work…

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

We prove the Tits-Weiss conjecture for Albert division algebras over fields of arbitrary characteristics in the affirmative. The conjecture predicts that every norm similarity of an Albert division algebra is a product of a scalar homothety…

Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…

Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…

Given a semisimple stable autonomous tensor category over a field $K$, to any group presentation with finite number of generators we associate an element $Q(P)\in K$ invariant under the Andrews-Curtis moves. We show that in fact, this is…

A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…

Due to a lack of coherent analysis, many common practices of humankind preserve low-efficient procedures. Balancing tubes during centrifugation exemplifies such a problem in laboratory practice. Using combination of symmetry group theory…

The compact genetic algorithm is an Estimation of Distribution Algorithm for binary optimisation problems. Unlike the standard Genetic Algorithm, no cross-over or mutation is involved. Instead, the compact Genetic Algorithm uses a virtual…

Gene tree/species tree reconciliation is a recent decisive progress in phylo-genetic methods, accounting for the possible differences between gene histories and species histories. Reconciliation consists in explaining these differences by…

Counterfactual explanations describe how to modify a feature vector in order to flip the outcome of a trained classifier. Obtaining robust counterfactual explanations is essential to provide valid algorithmic recourse and meaningful…

The evolution of genetic systems has been analyzed through the use of modifier gene models, in which a neutral gene is posited to control the transmission of other genes under selection. Analysis of modifier gene models has found the…

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…

This study proposes a data condensation method for multivariate kernel density estimation by genetic algorithm. First, our proposed algorithm generates multiple subsamples of a given size with replacement from the original sample. The…

The first author introduced a notion of equivalence on a family of $3$-manifolds with boundary, called (simple) balanced $3$-manifolds in an earlier paper and discussed the analogy between the Andrews-Curtis equivalence for group…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Models obtained by decision tree induction techniques excel in being interpretable.However, they can be prone to overfitting, which results in a low predictive performance. Ensemble techniques are able to achieve a higher accuracy. However,…

A probabilistic reconstruction of genealogies in a polyploid population (from 2x to 4x) is investigated, by considering genetic data analyzed as the probability of allele presence in a given genotype. Based on the likelihood of all possible…

Given only data generated by a standard confounding graph with unobserved confounder, the Average Treatment Effect (ATE) is not identifiable. To estimate the ATE, a practitioner must then either (a) collect deconfounded data;(b) run a…

The history of gene families -- which are equivalent to event-labeled gene trees -- can to some extent be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes.…