Results 71 to 80 of about 217,204 (287)

Combinatorial Yamabe flow on hyperbolic surfaces with boundary [PDF]

open access: yesCommunications in Contemporary Mathematics Vol. 13, No. 5 (2011) 827--842, 2010
This paper studies the combinatorial Yamabe flow on hyperbolic surfaces with boundary. It is proved by applying a variational principle that the length of boundary components is uniquely determined by the combinatorial conformal factor. The combinatorial Yamabe flow is a gradient flow of a concave function.
arxiv  

Combinatorial Interpretation of General Eulerian Numbers [PDF]

open access: yes, 2014
Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on general arithmetic progressions { a, a+d, a+2d,...}.
arxiv   +1 more source

Simulation of Inhomogeneous Refractive Index Fields Induced by Hot Tailored Forming Components

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents a simulation model for simulating inhomogeneous refractive index fields (IRIF) in hot‐forged components, accounting for thermal influences and complex geometries. Through this simulation, a priori knowledge about the propagation of the IRIF can be obtained, allowing for the positioning of the component or an optical measurement ...
Pascal Kern   +3 more
wiley   +1 more source

On The Total Irregularity Strength of Regular Graphs

open access: yesJournal of Mathematical and Fundamental Sciences, 2015
Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸 satisfy 𝑤𝑓(𝑥1𝑥2 ...
Rismawati Ramdani   +2 more
doaj   +1 more source

Solving Combinatorial Optimization Problems on Quantum Computers

open access: yesКібернетика та комп'ютерні технології, 2020
Introduction. Quantum computers provide several times faster solutions to several NP-hard combinatorial optimization problems in comparison with computing clusters.
Vyacheslav Korolyov   +1 more
doaj   +1 more source

Tame and Wild Scoring Play Games [PDF]

open access: yesarXiv, 2013
In this paper, we will be proving mathematically that scoring play combinatorial game theory covers all combinatorial games. That is, there is a sub-set of scoring play games that are identical to the set of normal play games, and a different sub-set that is identical to the set of mis\`ere play games.
arxiv  

An Ontology‐Augmented Digital Twin for Fiber‐Reinforced Polymer Structures at the Example of Wind Turbine Rotor Blades

open access: yesAdvanced Engineering Materials, EarlyView.
A methodology for establishing an ontology‐augmented structural digital twin for fiber‐reinforced polymer structures dedicated to individual lifetime prediction, in this case, a wind turbine rotor blade, is introduced. The methodology resembles the manufacturing as well as the operation of the structure.
Marc Luger   +6 more
wiley   +1 more source

Combinatorial Identities from the Spectral Theory of Quantum Graphs [PDF]

open access: yesarXiv, 2000
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
arxiv  

A Novel Simulation Approach for Damage Evolution during Tailored Forming

open access: yesAdvanced Engineering Materials, EarlyView.
Traditional damage models are struggling to accurately and efficiently simulate large‐scale three‐dimensional models with a great number of degrees of freedoms. A new gradient‐enhanced damage model based on the extended Hamilton principle can significantly reduce the computation time while ensuring mesh‐independence which is suitable to use in tailored
Fangrui Liu   +2 more
wiley   +1 more source

A Workflow‐Centric Approach to Generating FAIR Data Objects for Computationally Generated Microstructure‐Sensitive Mechanical Data

open access: yesAdvanced Engineering Materials, EarlyView.
A novel metadata schema is introduced to address the sparsity of microstructure‐sensitive mechanical data. The design follows the material modeling workflow, as each run results in the definition of unique data objects. The schema includes categorical elements to ensure findability, accessibility, interoperability, and reusability (FAIR). This approach
Ronak Shoghi, Alexander Hartmaier
wiley   +1 more source

Home - About - Disclaimer - Privacy