Search results for "put"

Derivation of a Homogenized Two-Temperature Model from the Heat Equation

2014

This work studies the heat equation in a two-phase material with spherical inclusions. Under some appropriate scaling on the size, volume fraction and heat capacity of the inclusions, we derive a coupled system of partial differential equations governing the evolution of the temperature of each phase at a macroscopic level of description. The coupling terms describing the exchange of heat between the phases are obtained by using homogenization techniques originating from [D. Cioranescu, F. Murat: Coll\`ege de France Seminar vol. 2. (Paris 1979-1980) Res. Notes in Math. vol. 60, pp. 98-138. Pitman, Boston, London, 1982.]

Error identities for variational problems with obstacles

2017

Codimension growth of central polynomials of Lie algebras

2019

Abstract Let L be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic zero and let I be the T-ideal of polynomial identities of the adjoint representation of L. We prove that the number of multilinear central polynomials in n variables, linearly independent modulo I, grows exponentially like ( dim ⁡ L ) n {(\dim L)^{n}} .

Abstracts from the CECAM workshop on computer simulations of cellular automata

1989

Аппроксимации по мере: задача Дирихле, универсальность и гипотеза Римана

2021

Аппроксимации по мере используются для решения асимптотической задачи Дирихле на произвольных открытых множествах, а также для демонстрации того обстоятельства, что многие функции, в том числе дзета-функция Римана, универсальны в смысле сходимости по мере. Выдвигается предположение о связи этих результатов с гипотезой Римана. Библиография: 12 наименований.

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three

2020

International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.

MonteCarlo Methods

2016

Emotions and Digital Delivery Platforms

2021

From the global spread of the infectious disease COVID-19, in Argentina as in other states worldwide, health measures, social emergency, economic and public order measures were taken. One of the main and earliest measures of social order in the face of this disease was the delimitation of a period of population isolation, known as preventive and obligatory social isolation. The compulsory social isolation generated unprecedented growth in the demand for services to the platform economies in Argentina in general and in Buenos Aires in particular, causing the platform delivery activity to be conceived as an essential activity. The purpose of the writing is to explore the configuration of a ce…

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …