Cumulative cultural evolution, population structure and the origin of combinatoriality in human language

Language is the primary repository and mediator of human collective knowledge. A central question for evolutionary linguistics is the origin of the combinatorial structure of language (sometimes referred to as duality of patterning), one of language’s basic design features. Emerging sign languages provide a promising arena to study the emergence of language properties. Many, but not all such sign languages exhibit combinatoriality, which generates testable hypotheses about its source. We hypothesize that combinatoriality is the inevitable result of learning biases in cultural transmission, and that population structure explains differences across languages. We construct an agent-based model with population turnover. Bayesian learning agents with a prior preference for compressible languages (modelling a pressure for language learnability) communicate in pairs under pressure to reduce ambiguity. We include two transmission conditions: agents learn the language either from the oldest agent or from an agent in the middle of their lifespan. Results suggest that (1) combinatoriality emerges during iterated cultural transmission under concurrent pressures for simplicity and expressivity and (2) population dynamics affect the rate of evolution, which is faster when agents learn from other learners than when they learn from old individuals. This may explain its absence in some emerging sign languages. We discuss the consequences of this finding for cultural evolution, highlighting the interplay of population-level, functional and cognitive factors. This article is part of a discussion meeting issue ‘The emergence of collective knowledge and cumulative culture in animals, humans and machines’.

Combinatorics of KP hierarchy structural constants

We investigate the structural constants of the KP hierarchy, which appear as universal coefficients in the paper of Natanzon–Zabrodin arXiv:1509.04472. It turns out that these constants have a combinatorial description in terms of transport coefficients in the theory of flow networks. Considering its properties we want to point out three novel directions of KP combinatorial structure research: connection with topological recursion, eigenvalue model for the structural constants and its deformations, possible deformations of KP hierarchy in terms of the structural constants. Firstly, in this paper we study the internal structure of these coefficients which involves: (1) construction of generating functions that have interesting properties by themselves; (2) restrictions on topological recursion initial data; (3) construction of integral representation or matrix model for these coefficients with non-trivial Ward identities. This shows that these coefficients appear in various problems of mathematical physics, which increases their value and significance. Secondly, we discuss their role in integrability of KP hierarchy considering possible deformation of these coefficients without changing the equations on $$\tau $$ τ -function. We consider several plausible deformations. While most failed even very basic checks, one deformation (involving Macdonald polynomials) passes all the simple checks and requires more thorough study.

CMMSE: Combinatorial structures and finite-dimensional alternative algebras

In this paper, the link between combinatorial structures and alternative algebras is studied, determining which configurations are associated with those algebras. Moreover, the isomorphism classes of each 2-dimensional configuration associated with these algebras is analyzed, providing a new method to classify them. In order to complement the theoretical study, two algorithmic methods are implemented: the first one constructs and draws the (pseudo)digraph associated with a given alternative algebra and the second one tests if a given combinatorial structure is associated with some alternative algebra.

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem

Exploiting Bilevel Optimization Techniques to Disconnect Graphs into Small Components In order to limit the spread of possible viral attacks in a communication or social network, it is necessary to identify critical nodes, the protection of which disconnects the remaining unprotected graph into a bounded number of shores (subsets of vertices) of limited cardinality. In the article “'Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem”, Furini, Ljubic, Malaguti, and Paronuzzi provide a new bilevel interpretation of the associated capacitated vertex separator problem and model it as a two-player Stackelberg game in which the leader interdicts (protects) the vertices, and the follower solves a combinatorial optimization problem on the resulting graph. Thanks to this bilevel interpretation, the authors derive different families of strengthening inequalities and show that they can be separated in polynomial time. The ideas exploited in their framework can also be extended to other vertex/edge deletion/insertion problems or graph partitioning problems by modeling them as two-player Stackelberg games to be solved through bilevel optimization.

Improved models for operation modes of complex compressor stations

We study combinatorial structures in large-scale mixed-integer (nonlinear) programming problems arising in gas network optimization. We propose a preprocessing strategy exploiting the observation that a large part of the combinatorial complexity arises in certain subnetworks. Our approach analyzes these subnetworks and the combinatorial structure of the flows within these subnetworks in order to provide alternative models with a stronger combinatorial structure that can be exploited by off-the-shelve solvers. In particular, we consider the modeling of operation modes for complex compressor stations (i.e., ones with several in- or outlets) in gas networks. We propose a refined model that allows to precompute tighter bounds for each operation mode and a number of model variants based on the refined model exploiting these tighter bounds. We provide a procedure to obtain the refined model from the input data for the original model. This procedure is based on a nontrivial reduction of the graph representing the gas flow through the compressor station in an operation mode. We evaluate our model variants on reference benchmark data, showing that they reduce the average running time between 10% for easy instances and 46% for hard instances. Moreover, for three of four considered networks, the average number of search tree nodes is at least halved, showing the effectivity of our model variants to guide the solver’s search.

Reducing SAT to Max2SAT

In the literature, we find reductions from 3SAT to Max2SAT. These reductions are based on the usage of a gadget, i.e., a combinatorial structure that allows translating constraints of one problem to constraints of another. Unfortunately, the generation of these gadgets lacks an intuitive or efficient method. In this paper, we provide an efficient and constructive method for Reducing SAT to Max2SAT and show empirical results of how MaxSAT solvers are more efficient than SAT solvers solving the translation of hard formulas for Resolution.

GEOMETRICAL AND MEASURE-THEORETIC STRUCTURES OF MAPS WITH A MOSTLY EXPANDING CENTER

In this article we study physical measures for $\operatorname {C}^{1+\alpha }$ partially hyperbolic diffeomorphisms with a mostly expanding center. We show that every diffeomorphism with a mostly expanding center direction exhibits a geometrical-combinatorial structure, which we call skeleton, that determines the number, basins and supports of the physical measures. Furthermore, the skeleton allows us to describe how physical measures bifurcate as the diffeomorphism changes under $C^1$ topology. Moreover, for each diffeomorphism with a mostly expanding center, there exists a $C^1$ neighbourhood, such that diffeomorphism among a $C^1$ residual subset of this neighbourhood admits finitely many physical measures, whose basins have full volume. We also show that the physical measures for diffeomorphisms with a mostly expanding center satisfy exponential decay of correlation for any Hölder observes. In particular, we prove that every $C^2$ , partially hyperbolic, accessible diffeomorphism with 1-dimensional center and nonvanishing center exponent has exponential decay of correlations for Hölder functions.

Rapid structure-based identification of potential SARS-CoV-2 main protease inhibitors

The COVID-19 outbreak has thrown the world into an unprecedented crisis. It has posed a challenge to scientists around the globe who are working tirelessly to combat this pandemic. We herein report a set of molecules that may serve as possible inhibitors of the SARS-CoV-2 main protease. To identify these molecules, we followed a combinatorial structure-based strategy, which includes high-throughput virtual screening, molecular docking and WaterMap calculations. The study was carried out using Protein Data Bank structures 5R82 and 6Y2G. DrugBank, Enamine, Natural product and Specs databases, along with a few known antiviral drugs, were used for the screening. WaterMap analysis aided in the recognition of high-potential molecules that can efficiently displace binding-site waters. This study may help the discovery and development of antiviral drugs against SARS-CoV-2.

Gradedness of the set of rook placements in A n−1

A rook placement is a subset of a root system consisting of positive roots with pairwise non-positive inner products. To each rook placement in a root system one can assign the coadjoint orbit of the Borel subgroup of a reductive algebraic group with this root system. Degenerations of such orbits induce a natural partial order on the set of rook placements. We study combinatorial structure of the set of rook placements in An− 1 with respect to a slightly different order and prove that this poset is graded.