Results 41 to 50 of about 6,828,332 (298)

An intersection problem for codes

open access: yesDiscrete Mathematics, 1990
Let \([s]^ n\) denote the set of sequences \((a_ 1,...,a_ n)\) with \(1\leq a_ i\leq s\). Let A be a subset of \([s]^ n\). It is called \((t_ 1,...,t_ s)\)-intersecting if for all \b{a} and ḇ in A and for every \(1\leq i\leq s\) there are at least \(t_ i\) positions j such that \(a_ j=b_ j=i\).
openaire   +3 more sources

The intersection problem for star designs

open access: yesDiscrete Mathematics, 1998
If \(G\) is a simple graph without isolated vertices, \(B\) is called a \(G\)-design if \(B\) is a finite set of graphs, each isomorphic to \(G\), with the property that for every pair \(u,v\) of vertices in the union of their vertex set, there is at most one graph in \(B\) of which \(uv\) is an edge. If \(H\) is the union of the graphs in \(B\), \(B\)
Billington, EJ, Hoffman, DG
openaire   +3 more sources

Homotopical intersection theory, III: Multirelative intersection problems [PDF]

open access: yesAlgebraic & Geometric Topology, 2019
This paper extends some results of Hatcher and Quinn beyond the metastable range. We give a bordism theoretic obstruction to deforming a map between manifolds simultaneously off of a collection of pairwise disjoint submanifolds under the assumption that it can be deformed off of any proper subcollection in a homotopy coherent way. In a certain range of
Klein, John R, Williams, Bruce
openaire   +3 more sources

New Numerical Solution for Two Parametric Surfaces Intersection Dragging Problem

open access: yesInternational Journal of Analysis and Applications, 2021
The problem of intersecting two parametric surfaces has been one of the main technical challenges in computer-aided design, computer graphics, solid modeling, and geometrics.
Ramadhan A. M. Alsaidi
doaj  

The Intersection Problem for Finite Monoids

open access: yesCoRR, 2017
We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their intersection. Our main result is that the problem is PSPACE-complete if V is contained in DS and NP-complete if V is non ...
Fleischer, Lukas, Kufleitner, Manfred
openaire   +5 more sources

A Framework for the Secretary Problem on the Intersection of Matroids [PDF]

open access: yesSIAM Journal on Computing, 2018
The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element
Moran Feldman   +2 more
openaire   +5 more sources

An intersection problem for finite automata

open access: yesDiscrete Applied Mathematics, 1988
Let M(A,S) be the set of all initial finite automata with state space S of k states and alphabet A of n letters and f: M(A,S)\(\to S\). The language accepted by \(M\in M(A,S)\) and f is the set of words in A mapping the initial state of M to f(M). A map f satisfies the m-intersection condition if for any m machines in M(A,S) there is a word accepted by
Michael E. Saks, Rick Statman
openaire   +1 more source

The Intersection of Two Vertex Coloring Problems [PDF]

open access: yesGraphs and Combinatorics, 2019
A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. Currently, the following two problems are unresolved: the complexity of coloring even hole-free graphs, and the complexity of coloring {4K1 ...
Angèle M. Foley   +4 more
openaire   +3 more sources

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Problems on Finite Automata and the Exponential Time Hypothesis

open access: yesAlgorithms, 2017
We study several classical decision problems on finite automata under the (Strong) Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection.
Henning Fernau, Andreas Krebs
doaj   +1 more source

Home - About - Disclaimer - Privacy