Results 11 to 20 of about 99,508 (238)

What Dynamic Approaches Have Taught Us About Cognition and What They Have Not: On Values in Motion and the Importance of Replicable Forms

open access: yesTopics in Cognitive Science, EarlyView., 2023
Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley   +1 more source

Rainbow perfect matchings in r-partite graph structures [PDF]

open access: yes, 2016
A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar   +2 more
core   +2 more sources

Unimodality Problems in Ehrhart Theory

open access: yes, 2017
Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*
A. Stapledon   +45 more
core   +1 more source

Some remarks on multiplicity codes

open access: yes, 2014
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core   +1 more source

Steiner Triple Systems With High Discrepancy

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner   +2 more
wiley   +1 more source

Poset topology and homological invariants of algebras arising in algebraic combinatorics [PDF]

open access: yes, 2013
We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay.
Margolis, Stuart   +2 more
core   +4 more sources

A Study On Combinatorics Indiscrete Mathematics

open access: yes, 2018
{"references": ["1.\tArumugam. S & Isaac. A. T, \"Modern Algebra\", Scitech Publications Pvt. Ltd, Chennai. 2.\tLiu. C. L \"Elements of Discrete Mathematics\", MC Graw Hill, Internation Edition. 3.\tTremblay. J. P & Manohar. R, \"Discrete Mathematics Structure with application to computer science\", TMH Edition 1007. 4.\tVeerarajan.
G. Rajkumar, Dr. V. Ramadoss
openaire   +1 more source

Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT Let Q $Q$ be an n×n $n\times n$ array whose top left r×s $r\times s$ sub‐array L $L$ is filled with a set of k $k$ different symbols such that each cell of L $L$ contains λ $\lambda $ symbols. In this note, we find conditions under which each empty cell of Q $Q$ can be filled with λ $\lambda $ symbols in such a way that the total number of ...
Amin Bahmanian
wiley   +1 more source

New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh   +2 more
wiley   +1 more source

Chutes and Ladders with Large Spinners

open access: yes, 2014
We prove a conjecture from a 2011 College Mathematics Journal article addressing the expected number of turns in a Chutes and Ladders game when the spinner range is close to the length of the board.
Connors, Darcie E., Glass, Darren B.
core   +1 more source

Home - About - Disclaimer - Privacy