Results 1 to 10 of about 11,009,901 (116)
Rhombic tilings of (n,k)-Ovals, (n,k,λ)-cyclic difference sets, and related topics [PDF]
, 2013 Each fixed integer nnhas associated with it ⌊n2⌋ rhombs: ρ1,ρ2,…,ρ⌊n2⌋, where, for each 1≤h≤⌊n2⌋, rhomb ρhρh is a parallelogram with all sides of unit length and with smaller face angle equal toh×πn radians.
McSorley, John, Schoen, Alan
core +1 more source
The construction of Complete (kn,n)-arcs in The Projective Plane PG(2,5) by Geometric Method, with the Related Blocking Sets and Projective Codes [PDF]
, 2014 A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc.
Baghdad Science Journal
core +1 more source
Existence Of (47,5)- Arcs in The Projective Plane PG (2,13) [PDF]
, 2004 In this work we show the existence of complete (47,5)- arcs which are unknown until now. The upper bound for the (k,5)- arcs is narrowed in the finite projective plane PG (2,13). The narrowing is fulfilled by finding complete (47,5)-arcs which are 372
Shuaa Aziz
core +1 more source
Blocking the k-Holes of Point Sets in the Plane [PDF]
, 2015 Let P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its convex hull.
Tejel, Javier +5 more
core +3 more sources
Blocking optimal k-arborescences [PDF]
, 2015 Given a digraph $D=(V,A)$ and a positive integer $k$, an arc set $F\subseteq A$ is called a $k$-arborescence if it is the disjoint union of $k$ spanning arborescences.
Bernáth, Attila, Király, Tamás
core +2 more sources
Angewandte Chemie, EarlyView.Oncogenic MYC is a transcription factor that is difficult to inhibit. However, precise positioning of an acrylamide electrophile in MAX to covalently bond to the unique Cys438 in MYC, enabled shortening and optimizing of MAX‐derived, helix‐constrained peptides with high‐affinity and selectivity.
Aline Dantas de Araujo +7 more
wiley +2 more sources
The construction of Complete (kn,n)-arcs in The Projective Plane PG(2,5) by Geometric Method, with the Related Blocking Sets and Projective Codes [PDF]
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc.
Hassan, Umniyat A., Al-Mukhtar, Amal SH
core +1 more source
A characterization of multiple (n-k)-blocking sets in projective spaces of square order [PDF]
, 2012 In [10], it was shown that small t-fold (n - k)-blocking sets in PG(n, q), q = p(h), p prime, h >= 1, intersect every k-dimensional space in t (mod p) points. We characterize in this article all t-fold (n k)-blocking sets in PG(n, q), q square, q >= 661,
Weiner, Zsuzsa +5 more
core +1 more source
Advanced Healthcare Materials, EarlyView.Open‐port, barrier‐free microfluidic device for modeling early metastatic progression. A centrally positioned tumor spheroid releases invasive cells that migrate through the surrounding matrix and intravasate into endothelialized lateral channels.
Vira Sharko +7 more
wiley +1 more source
Breaking the Surface: Buoyant Metal–Polymer Open–Cell Hybrid Lattice Metamaterials
Advanced Materials, EarlyView.Open‐cell metal–polymer lattice metamaterials that defy sinking. (a) Injection process of the polyurethane (PU) foam into the titanium (Ti‐6Al‐4V) hollow‐strut lattice creating the open‐cell Ti‐6Al‐4V+PU hybrid lattice, (b) flotation test of a hybrid lattice specimen, and (c) a digital representation and experimental validation of a marine buoy ...
Jordan Noronha +7 more
wiley +1 more source