Processing of line- and luminance-defined triangles was investigated by studying visual potentials (VEPs) evoked by triangles. Twenty-six subjects were randomly presented with line, grey, and illusory triangles. Relative to VEPs elicited by grey and illusory triangles, VEPs to line triangles included P220s that were smaller at frontal sites but larger at occipital sites, and N260s that were sma...

we give some sufficient conditions under which the tuple of the adjoint of weighted composition operators $(c_{omega_1,varphi_1}^*‎ , ‎c_{omega_2,varphi_2}^*)$ on the hilbert space $mathcal{h}$ of analytic functions is supercyclic‎.

We investigate the phase behavior of a system of hard equilateral and right-angled triangles in two dimensions using Monte Carlo simulations. Hard equilateral triangles undergo a continuous isotropic-triatic liquid crystal phase transition at packing fraction ϕ = 0.7. Similarly, hard right-angled isosceles triangles exhibit a first-order phase transition from an isotropic fluid phase to a rhomb...

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

Triangles are an important building block and distinguishing feature of real-world networks, but their structure is still poorly understood. Despite numerous reports on the abundance of triangles, there is very little information on what these triangles look like. We initiate the study of degreelabeled triangles — specifically, degree homogeneity versus heterogeneity in triangles. This yields n...

The rendering process reduces the 3D geometry to a set of 2D triangles in the image plane. The projection from 3D is standard. The projected triangles are clipped and sorted so that the final collection of triangles in a pixel do not overlap each other. So at frame f , the image plane holds a collection of pixels Pk, k = 1, . . .M , each of which contains a set of 2D nonoverlapping triangles {T...

A triple of vertices in a graph is a frustrated triangle if it induces an odd number of edges. We study the set Fn ⊂ [0, n 3  ] of possible number of frustrated triangles f (G) in a graph G on n vertices. We prove that about two thirds of the numbers in [0, n3/2] cannot appear in Fn, and we characterise the graphs G with f (G) ∈ [0, n3/2]. More precisely, our main result is that, for each n ≥...

We discuss the numerical computation of sensitivities via the adjoint approach in optimization problems governed by differential equations. We focus on the adjoint problem in its weak form. We show how one can avoid some of the problems with the adjoint approach, such as deriving suitable boundary conditions for the adjoint equation. We discuss the convergence of numerical approximations of the...