Results 31 to 40 of about 6,526 (216)

Utterance evolution: the road to generative, combinatorial communicators

Biological Reviews, EarlyView.
ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford, Roman Martin Wittig, Cedric Girard‐Buttoz   +2 more
wiley   +1 more source

Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs

Discussiones Mathematicae Graph Theory, 2019
For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj   +1 more source

Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers [PDF]

Discrete Mathematics & Theoretical Computer Science, 2008
We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes.
Christopher Eagle, Zhicheng Gao, Mohamed Omar, Daniel Panario, Bruce Richmond   +4 more
doaj   +1 more source

What Constitutes an Attractive Product‐as‐a‐Service Offer? Examining Consumer Preferences for (Circular) Business Patterns

Business Strategy and the Environment, EarlyView.
ABSTRACT Little is known about consumer preferences for combinations of circular business model patterns, despite their potential to benefit the design of product services. This study examines consumer preferences for product‐as‐a‐service offers, combined with circular product attributes, across Sweden and the Netherlands.
Steven Sarasini, Aemiro Melkamu Daniel, Katherine Whalen, Nancy Bocken, Agnieszka Hunka, Tarlan Ahmadov   +5 more
wiley   +1 more source

Constructing elliptic curve isogenies in quantum subexponential time

Journal of Mathematical Cryptology, 2014
Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew, Jao David, Soukharev Vladimir   +2 more
doaj   +1 more source

List circular backbone colouring [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj   +1 more source

Teaching Combinatorial Principles Using Relations through the Placemat Method

Mathematics, 2021
The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific ...
Viliam Ďuriš, Gabriela Pavlovičová, Dalibor Gonda, Anna Tirpáková   +3 more
doaj   +1 more source

Mixed Steiner Triple Systems With Shortest Length

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley   +1 more source

Generalized Rainbow Connection of Graphs and their Complements

Discussiones Mathematicae Graph Theory, 2018
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang, Magnant Colton, Wei Meiqin, Zhu Xiaoyu   +3 more
doaj   +1 more source

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, EarlyView.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source