Searcharxiv⌕ Search

arXiv subjects

Josip Žubrinić

Publications and source records attributed to Josip Žubrinić.

13 recordsLinked to original sources

Homogenization of elasto-plastic plate equations with vanishing hardening

We study the asymptotic behavior of thin heterogeneous elastoplastic plates in the framework of linearized elastoplasticity, focusing on the regime where the plate thickness vanishes much faster than the characteristic scale of the material's periodic microstructure. In contrast to earlier analyzes that required restrictive geometric assumptions on admissible yield surfaces, our approach accommodates general relations between phases without imposing any specific ordering. The analysis proceeds in two main steps. First, we rigorously derive a heterogeneous plate model with both isotropic and kinematic hardening through a dimension reduction procedure based on evolutionary $Γ$-convergence. This result extends existing plate models for homogeneous materials to the heterogeneous setting and allows for general forms of hardening and dissipation potentials. In the second step, we perform two-scale homogenization while simultaneously letting the hardening tend to zero. This process yields an effective elasto-perfectly plastic plate model and, crucially, provides a characterization of the dissipation potential at the interfaces between different phases. The resulting dissipation functional takes the form of a non-local inf-convolution of the traces of plastic strains on both sides of the interface, reflecting the Kirchhoff-Love structure of admissible displacements.

math.AP↗

Higher-order homogenization for equations of linearized elasticity using the operator-asymptotic approach

The operator-asymptotic approach was introduced by Lim-Žubrinić in [Asymptotic Analysis. 141(4), p. 211-256 (2025)] for the homogenization of an $\varepsilon\mathbb{Z}^d$-periodic composite media. In this article, we consider the setting of three-dimensional linearized elasticity, and extend the approach to obtain higher-order convergence rates. In particular, we consider the so-called ``Bloch approximation'' for vector-valued functions with compact Fourier support, and demonstrate that under such data, the approach provides an expansion that yields an error of order $\varepsilon^{n+1}$ in $L^2$ and $\varepsilon^n$ in $H^1$, for any $n$.

math.AP↗

Poroelastic plate model obtained by simultaneous homogenization and dimension reduction

In this paper, the starting point of our analysis is a coupled system of linear elasticity and Stokes equation. We consider two small parameters: the thickness $h$ of the thin plate and the pore scale $\varepsilon(h)$ which depends on $h$. We will focus specifically on the case when the pore size is comparatively small relative to the thickness of the plate. The main goal here is derive a model of a poroelastic plate, starting from the $3D$ problem as $h$ goes to zero, using simultaneous homogenization and dimension reduction techniques. The obtained model generalizes the poroelastic plate model derived by A. Mikelić et. al. in 2015 using dimension reduction techniques from $3D$ Biot's equations in the sense that it also covers the case of contacts of poroelastic and (poro)elastic plate as well as the evolution equation with inertial term.

math.AP↗

An operator-asymptotic approach to periodic homogenization for equations of linearized elasticity

We present an operator-asymptotic approach to the problem of homogenization of periodic composite media in the setting of three-dimensional linearized elasticity. This is based on a uniform approximation with respect to the inverse wavelength $|χ|$ for the solution to the resolvent problem when written as a superposition of elementary plane waves with wave vector (``quasimomentum") $χ$. We develop an asymptotic procedure in powers of $|χ|$, combined with a new uniform version of the classical Korn inequality. As a consequence, we obtain $L^2\to L^2$, $L^2\to H^1$, and higher-order $L^2\to L^2$ norm-resolvent estimates in $\mathbb{R}^3$. The $L^2 \to H^1$ and higher-order $L^2 \to L^2$ correctors emerge naturally from the asymptotic procedure, and the former is shown to coincide with the classical formulae.

math.AP↗

A model of random sequential adsorption on a ladder graph

In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed state when no further additions are possible. We analyze a class of RSA models on a two-row square ladder graph in which landing on an empty site in a graph is allowed when at least $b$ neighboring sites in the graph are unoccupied ($b \in \mathbb{N}$). In this paper we complement this typical way of studying RSA models by analyzing also the structure of the set of all jammed states in a static way, disregarding the dynamics that led to a particular jammed state. In both considered settings (dynamic and static) we provide explicit expressions for key statistics that describe the average proportion of the substrate covered by deposited objects, and then we comment on significant differences between the two settings. We illustrate all of our findings through a toy model for ensembles of trapped Rydberg atoms with blockade range $b$.

cond-mat.stat-mech↗

Predators and altruists arriving on jammed Riviera

The Riviera model is a combinatorial model for a settlement along a coastline, introduced recently by the authors. Of most interest are the so-called jammed states, where no more houses can be built without violating the condition that every house needs to have free space to at least one of its sides. In this paper, we introduce new agents (predators and altruists) that want to build houses once the settlement is already in the jammed state. Their behavior is governed by a different set of rules, and this allows them to build new houses even though the settlement is jammed. Our main focus is to detect jammed configurations that are resistant to predators, to altruists, and to both predators and altruists. We provide bivariate generating functions, and complexity functions (configurational entropies) for such jammed configurations. We also discuss this problem in the two-dimensional setting of a combinatorial settlement planning model that was also recently introduced by the authors, and of which the Riviera model is just a special case.

math.CO↗

Operator-norm resolvent estimates for thin elastic periodically heterogeneous rods in moderate contrast

We provide resolvent asymptotics as well as various operator-norm estimates for the system of linear partial differential equations describing the thin infinite elastic rod with material coefficients which periodically highly oscillate along the rod. The resolvent asymptotics is derived simultaneously with respect to the thickness of the rod and the period of material oscillations. These two parameters are taken to be of the same order. The analysis is carried out separately on two invariant subspaces pertaining to the out-of-line and in-line displacements, under some additional assumptions, as well as in the general case where these two sorts of displacements intertwine inseparably.

math.AP↗

Complexity Function of Jammed Configurations of Rydberg Atoms

In this article, we determine the complexity function (configurational entropy) of jammed configurations of Rydberg atoms on a one-dimensional lattice. Our method consists of providing asymptotics for the number of jammed configurations determined by direct combinatorial reasoning. In this way we reduce the computation of complexity to solving a constrained optimization problem for the Shannon's entropy function. We show that the complexity can be expressed explicitly in terms of the root of a certain polynomial of degree $b$, where $b$ is the so-called blockade range of a Rydberg atom. Our results are put in a relation with the model of irreversible deposition of $k$-mers on a one-dimensional lattice.

math.CO↗

On a variant of Flory model

We consider a one-dimensional variant of a recently introduced settlement planning problem in which houses can be built on finite portions of the rectangular integer lattice subject to certain requirements on the amount of insolation they receive. In our model, each house occupies a unit square on a $1 \times n$ strip, with the restriction that at least one of the neighboring squares must be free. We are interested mostly in situations in which no further building is possible, i.e. in maximal configurations of houses in the strip. We reinterpret the problem as a problem of restricted packing of vertices in a path graph and then apply the transfer matrix method in order to compute the bivariate generating functions for the sequences enumerating all maximal configurations of a given length with respect to the number of houses. This allows us to determine the asymptotic behavior of the enumerating sequences and to compute some interesting statistics. Along the way, we establish close connections between our maximal configurations and several other types of combinatorial objects, including restricted permutations and walks on certain small oriented graphs. In all cases we provide combinatorial proofs. We then generalize our results in several directions by considering multi-story houses, by varying the insolation restrictions, and, finally, by considering strips of width 2 and 3. At the end we comment on several possible directions of future research.

math.CO↗

Spectral and evolution analysis of composite elastic plates with high contrast

We analyse the behaviour of thin composite plates whose material properties vary periodically in-plane and possess a high degree of contrast between the individual components. Starting from the equations of three-dimensional linear elasticity that describe soft inclusions embedded in a relatively stiff thin-plate matrix, we derive the corresponding asymptotically equivalent two-dimensional plate equations. Our approach is based on recent results concerning decomposition of deformations with bounded scaled symmetrised gradients. Using an operator-theoretic approach, we calculate the limit resolvent and analyse the associated limit spectrum and effective evolution equations. We obtain our results under various asymptotic relations between the size of the soft inclusions (equivalently, the period) and the plate thickness as well as under various scaling combinations between the contrast, spectrum, and time. In particular, we demonstrate significant qualitative differences between the asymptotic models obtained in different regimes.

math.AP↗

Packing density of combinatorial settlement planning models

Recently, a combinatorial settlement planning model was introduced. The idea underlying the model is that the houses are randomly being built on a rectangular tract of land according to the specified rule until the maximal configuration is reached, that is, no further houses can be built while still following that rule. Once the building of the settlement is done, the main question is what percentage of the tract of land on which the settlement was built has been used, i.e. what is the building density of the maximal configuration that was reached. In this article, with the aid of simulations, we find an estimate for the average building density of maximal configurations and we study what happens with this average when the size of a tract of land grows to infinity.

math.CO↗

Combinatorial settlement planning

In this article, we consider a combinatorial settlement model on a rectangular grid where at least one side (east, south or west) of each house must be exposed to sunlight without obstructions. We are interested in maximal configurations, where no additional houses can be added. For a fixed $m\times n$ grid we explicitly calculate the lowest number of houses, and give close to optimal bounds on the highest number of houses that a maximal configuration can have. Additionally, we provide an integer programming formulation of the problem and solve it explicitly for small values of $m$ and $n$.

math.CO↗