Results 41 to 50 of about 28,946 (263)
On a combinatorial problem in geometry
AbstractDenote by g(n) the cardinality of a minimal subset C of an n × n square array of lattice points which does not contain the vertices of a square with sides parallel to the axes, but which is such that the addition of any new point to C forces the appearance of such a square. It is proved that g(n) < nα for some α < 2.
Harvey L. Abbott, Denis Hanson
openaire +1 more source
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Combinatorial Estimations on Burnside Type Problems
The Burnside problem, formulated by W. Burnside in 1902, is one of the most well-known and important open questions in the field of Group Theory. Despite significant progress made in the past century towards solving this problem, its complete solution ...
Anton Beletskiy, Ilya Ivanov-Pogodaev
doaj +1 more source
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
On a problem in combinatorial geometry
AbstractLet us fix a number α ...
openaire +1 more source
A combinatorial approach to the classification problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanev, N., Balev, S.
openaire +3 more sources
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
On Large Sum-Free Sets: Revised Bounds and Patterns
In this paper, we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of [1,n] with the lowest value in n3,n2, and the identification of all patterns that can be used to form sum-free ...
Renato Cordeiro de Amorim
doaj +1 more source
Bird Mating Optimizer for Combinatorial Optimization Problems
The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to solve continuous optimization problems with a very promising performance.
Anas Arram +3 more
doaj +1 more source
A combinatorial problem in logic
AbstractThis short note is an application of some theorems of graph theory to the problem of the minimum number of counter-examples needed to show that a special class of theories is complete.
Claude Berge 0001, A. Ramachandra Rao
openaire +2 more sources

