Botirov et al., 2022 - Google Patents

On the set of Gibbs measures for model with a countable set of spin values on Cayley trees.

Botirov et al., 2022

Document ID
3329230525657882532
Author
Botirov G
Haydarov F
Publication year
Publication venue
Positivity

External Links

Snippet

On the set of Gibbs measures for model with a countable set of spin values on Cayley trees Page 1 Positivity (2022) 26:50 https://doi.org/10.1007/s11117-022-00900-6 Positivity On the set of Gibbs measures for model with a countable set of spin values on Cayley trees Golibjon …
Continue reading at openurl.ebsco.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
    • G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3074—Audio data retrieval
    • G06F17/30778—Audio database index structures and management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models

Similar Documents

Publication Publication Date Title
Korže et al. General position sets in two families of Cartesian product graphs
Fidkowski et al. Disentangling the generalized double semion model
Fomin et al. Subtraction-free complexity, cluster transformations, and spanning trees
Bujtás et al. On specific factors in graphs
Glos et al. Upperbounds on the probability of finding marked connected components using quantum walks: A. Glos et al.
Leygonie et al. Algorithmic reconstruction of the fiber of persistent homology on cell complexes
Botirov et al. On the set of Gibbs measures for model with a countable set of spin values on Cayley trees
Choi et al. Revisiting link prediction with the dowker complex
Sati et al. Quantum and reality: H. Sati, U. Schreiber
Dey et al. Filtration simplification for persistent homology via edge contraction
Chen et al. 2-Disjoint-path-coverable panconnectedness of crossed cubes
Solomadin On independent GKM-graphs without nontrivial extensions
Scholz Representing distance-hereditary graphs with multi-rooted trees
Harding et al. Remarks on orthogonality spaces
Chen Rigidity and stability of submanifolds with entropy close to one
Labourie et al. The probabilistic nature of McShane’s identity: planar tree coding of simple loops
Alizadeh et al. Solving the Mostar index inverse problem
Cai et al. A large family of strongly regular graphs with small Weisfeiler-Leman dimension
Fischer et al. The space of tree-based phylogenetic networks
Kuz’min et al. On 5-and 6-leaved trees with the largest number of matchings
Speissegger Pfaffian sets and o-minimality
Banakh et al. A simple Efimov space with sequentially-nice space of probability measures
Donoso et al. On recurrence for Z d-Weyl systems
Chen et al. Complexity results for two kinds of colored disconnections of graphs
van Bommel et al. Reduction of plane quartics and Dixmier–Ohno invariants