Results 41 to 50 of about 74,505 (227)
Tangency quantum cohomology and characteristic numbers
This work establishes a connection between gravitational quantum cohomology and enumerative geometry of rational curves (in a projective homogeneous variety) subject to conditions of infinitesimal nature like, for example, tangency.
JOACHIM KOCK
doaj +1 more source
COMBINATORIAL ANALYSIS OF THE DOMINOES SCHEME AND THE CASE OF FIXED MINIMAL FIGURE ON A DOMINO TILE
The dominoes scheme is defined as a scheme of random tiling with poliomino tiles with $r$ ends and $n$ figures from 0 to $(n-1)$ on the ends of tiles of all possible compositions with repetitions, regardless of their order.
Natalia Enatskaya
doaj +1 more source
ABSTRACT The motivation of this paper is to explore and generalize Sakaguchi‐type functions, which play a significant role in geometric function theory. In this context, we introduce four new classes of analytic univalent functions: ℑΨ,tb,α,ρ,ℑϑb,α,ρ,ℑΘ,mb,α,ρ$$ {\Im}_{\Psi, t}^{b,\alpha, \rho },\kern0.3em {\Im}_{\vartheta}^{b,\alpha, \rho },\kern0.3em
Arzu Akgül
wiley +1 more source
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes
ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley +1 more source
Extensions of Steiner Triple Systems
ABSTRACT In this article, we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop. We investigate extensions of Steiner loops, focusing in particular on the case of Schreier extensions, which provide a ...
Giovanni Falcone+2 more
wiley +1 more source
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos+3 more
doaj +1 more source
On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays
ABSTRACT In this article, we study the BM quasi‐Hermitian varieties, laying in the three‐dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in ...
Angela Aguglia+3 more
wiley +1 more source
Towards Nash‐Williams orientation conjecture for infinite graphs
Abstract In 1960 Nash‐Williams proved that an edge‐connectivity of 2 k is sufficient for a finite graph to have a k
wiley +1 more source
A Review of Modern Multinomial‐Derived and Partition‐Based Record‐Linkage Methods
ABSTRACT Fellegi and Sunter introduced in 1969 the first theory of record linkage. Their work was interpreted and applied in many situations. However, an infrastructure to support generalizing the theory was not available until 40 years later when Sadinle and Fienberg formally introduced partitioning in the record linkage arena.
Yves Thibaudeau
wiley +1 more source
Abstract We provide partial solutions to two problems posed by Shehtman concerning the modal logic of the Čech–Stone compactification of an ordinal space. We use the Continuum Hypothesis to give a finite axiomatization of the modal logic of β(ω2)$\beta (\omega ^2)$, thus resolving Shehtman's first problem for n=2$n=2$. We also characterize modal logics
Guram Bezhanishvili+3 more
wiley +1 more source