Fire design method for concrete filled tubular columns based on equivalent concrete core cross-section

In this work, a method for a realistic cross-sectional temperature prediction and a simplified fire design method for circular concrete filled tubular columns under axial load are presented. The generalized lack of simple proposals for computing the cross-sectional temperature field of CFT columns when their fire resistance is evaluated is evident. Even Eurocode 4 Part 1-2, which provides one of the most used fire design methods for composite columns, does not give any indications to the designers for computing the cross-sectional temperatures. Given the clear necessity of having an available method for that purpose, in this paper a set of equations for computing the temperature distribution of circular CFT columns filled with normal strength concrete is provided. First, a finite differences thermal model is presented and satisfactorily validated against experimental results for any type of concrete infill. This model consideres the gap at steel-concrete interface, the moisture content in concrete and the temperature dependent properties of both materials. Using this model, a thermal parametric analysis is executed and from the corresponding statistical analysis of the data generated, the practical expressions are derived. The second part of the paper deals with the development of a fire design method for axially loaded CFT columns based on the general rules stablished in EN 1994-1-1 and employing the concept of room temperature equivalent concrete core cross-section. In order to propose simple equations, a multiple nonlinear regression analysis is made with the numerical results generated through a thermo-mechanical parametric analysis. Once more, predicted results are compared to experimental values giving a reasonable accuracy and slightly safe results.The authors would like to express their sincere gratitude to the Spanish Ministry of Economy and Competitivity for the help provided through the project BIA2012-33144, and to the European Community for the FEDER funds.Ibáñez Usach, C.; Aguado, JV.; Romero, ML.; Espinós Capilla, A.; Hospitaler Pérez, A. (2015). Fire design method for concrete filled tubular columns based on equivalent concrete core cross-section. Fire Safety Journal. 78:10-23. https://doi.org/10.1016/j.firesaf.2015.07.009S10237

Boxicity of Line Graphs

Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2\Delta(\lceil log_2(log_2(\Delta)) \rceil + 3) + 1, where \Delta denotes the maximum degree of G. Since \Delta <= 2(\chi - 1), for any line graph G with chromatic number \chi, box(G) = O(\chi log_2(log_2(\chi))). For the d-dimensional hypercube H_d, we prove that box(H_d) >= (\lceil log_2(log_2(d)) \rceil + 1)/2. The question of finding a non-trivial lower bound for box(H_d) was left open by Chandran and Sivadasan in [L. Sunil Chandran and Naveen Sivadasan. The cubicity of Hypercube Graphs. Discrete Mathematics, 308(23):5795-5800, 2008]. The above results are consequences of bounds that we obtain for the boxicity of fully subdivided graphs (a graph which can be obtained by subdividing every edge of a graph exactly once).Comment: 14 page

Lp−LqL^p-L^q estimates for maximal operators associated to families of finite type curves

We study the boundedness problem for maximal operators $\mathbb{M}$ associated to averages along families of finite type curves in the plane, defined by $$\mathbb{M}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{\mathbb{C}} f(x-ty) \, \rho(y) \, d\sigma(y)\right|,$$ where $d\sigma$ denotes the normalised Lebesgue measure over the curves $\mathbb{C}$. Let $\triangle$ be the closed triangle with vertices $P=(\frac{2}{5}, \frac{1}{5}), ~ Q=(\frac{1}{2}, \frac{1}{2}), ~ R=(0, 0).$ In this paper, we prove that for $(\frac{1}{p}, \frac{1}{q}) \in (\triangle \setminus \{P, Q\}) \cap \left\{(\frac{1}{p}, \frac{1}{q}) :q > m \right\}$, there is a constant $B$ such that $\|\mathbb{M}f\|_{L^q(\mathbb{R}^2)} \leq \, B \, \|f\|_{L^p(\mathbb{R}^2)}$. Furthermore, if $m <5,$ then we have $\|\mathbb{M}f\|_{L^{5, \infty}(\mathbb{R}^2)} \leq B \|f\|_{L^{\frac{5}{2} ,1} (\mathbb{R}^2)}.$ We shall also consider a variable coefficient version of maximal theorem and we obtain the $L^p-L^q$ boundedness result for $(\frac{1}{p}, \frac{1}{q}) \in \triangle^{\circ} \cap \left\{(\frac{1}{p}, \frac{1}{q}) :q > m \right\},$ where $\triangle^{\circ}$ is the interior of the triangle with vertices $(0,0), ~(\frac{1}{2}, \frac{1}{2}), ~(\frac{2}{5}, \frac{1}{5}).$ An application is given to obtain $L^p-L^q$ estimates for solution to higher order, strictly hyperbolic pseudo-differential operators.Comment: 16 pages. revised version of the file. Several references have been modified. arXiv admin note: text overlap with arXiv:1510.08649, arXiv:1609.0814

Bipartite powers of k-chordal graphs

Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G^m is chordal then so is G^{m+2}. Brandst\"adt et al. in [Andreas Brandst\"adt, Van Bang Le, and Thomas Szymczak. Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics, 177(1-3):9-16, 1997.] showed that if G^m is k-chordal, then so is G^{m+2}. Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. Given a bipartite graph G and an odd positive integer m, we define the graph G^{[m]} to be a bipartite graph with V(G^{[m]})=V(G) and E(G^{[m]})={(u,v) | u,v \in V(G), d_G(u,v) is odd, and d_G(u,v) \leq m}. The graph G^{[m]} is called the m-th bipartite power of G. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G^{[m]}, where k, m are positive integers such that k \geq 4 and m is odd.Comment: 10 page