Affirmative Answer Research Articles

Using prosody to express evidentiality. The case of the quotative

The goal of this study was to investigate if pure prosodic marking of evidentiality, more specifically quotation, does exist and, secondly, if the particular prosodic traits involved in such prosodic marking are arbitrary or somewhat motivated. Data containing a set of identical sentence pairs in Spanish (the only difference being the presence or absence of quotation in them) was collected by means of a Discourse Completion Task and analyzed in order to find prosodic patterns. The results suggested that an affirmative answer must be given to the first question, as the quoted fragments were consistently marked in the four languages with a break before the quoted fragment (and often after it) and a change in voice quality, more specifically by raising the pitch of the snippet. An extension of the study was carried out in three different languages from three different language families (Swedish, Polish and Hungarian) to check if the traits observed were an idiosyncratic feature of Spanish or a more widespread phenomenon. The same conclusive results were observed in all three languages. Regarding the question of the arbitrariness or motivation of the prosodic markers, the results suggest that both of the prosodic traits found are indeed motivated. Speakers use metonymically traits that are the most salient when in an everyday conversation a new speaker takes the floor (a gap and a change of voice quality) to convey that the enunciator has changed and the fragment at glance is to be attributed to an individual other than the speaker. The consistent choice of pitch raising to mark the change of enunciator (as opposed to pitch lowering, for example) is argued to be related to issues of language embodiment.

Biases in niche construction

ABSTRACT Niche construction theory highlights the active role of organisms in modifying their environment. A subset of these modifications is the developmental niche, which concerns ecological, epistemic, social and symbolic legacies inherited by organisms as resources that scaffold their developmental processes. Since in this theory development is a situated process that takes place in a culturally structured environment, we may reasonably ask if implicit cultural biases may, in some cases, be responsible for maladaptive developmental niches. In this paper we wish to argue for an affirmative answer. In order to do so, we first propose to conceptualize implicit bias as embodied perceptual habits, and then proceed to show that these habits are at least partially responsible for maladaptive developmental niches of children with Down syndrome and autism. With this framework we thus hope to bring together two fields of research that haven’t been explicitly connected: implicit bias and niche construction theory. Linking these two theories may bring benefits both to implicit bias researchers, who can extend this concept to characterize other sets of processes as biased, as well as to niche construction theorists, who will have a useful theoretical tool to diagnose maladaptive features of niches brought about by sociocultural biases.

A note on Gorenstein projective and Gorenstein flat modules

We prove that all Gorenstein projective modules are Gorenstein flat if and only each Gorenstein projective module has finite Gorenstein flat dimension. As applications, some characterizations of strongly CM-free rings are established and an affirmative answer to a question posed by Wang [Colloq. Math. 170 (2022) 1–13] is obtained.

Energy conservation of weak solutions for the incompressible Euler equations via vorticity

Motivated by the works of Cheskidov, Lopes Filho, Nussenzveig Lopes and Shvydkoy in [8, Commun. Math. Phys. 348: 129-143, 2016] and Chen and Yu in [5, J. Math. Pures Appl. 131: 1-16, 2019], we address how the Lp control of vorticity could influence the energy conservation for the incompressible homogeneous and nonhomogeneous Euler equations in this paper. For the homogeneous flow in the periodic domain or whole space, we provide a self-contained proof for the criterion ω=curlv∈L3(0,T;L3nn+2(Ω))(n=2,3), that generalizes the corresponding result in [8] and can be viewed as in Onsager critical spatio-temporal spaces. Regarding the nonhomogeneous flow, it is shown that the energy is conserved as long as the vorticity lies in the same space as before and ∇ρ belongs to L∞(0,T;Ln(Tn))(n=2,3), which gives an affirmative answer to a problem proposed by Chen and Yu in [5].

A sufficient condition for global existence of the solution to nonlinear damped wave equations at arbitrary positive initial energy

AbstractWe consider the global existence of the solution for nonlinear damped wave equations at arbitrary positive initial energy, that is, . It is well known from a work of G. Filippo and S. Marco [Ann. Inst. H. Poincaré Anal. Non Linéaire, 2006], that which initial data with high energy make the model exists global solutions is still an interesting question. Here, we give it an affirmative answer. For this purpose, we suggest a unified approach, which is also valid where various forms of damping are present. Applying it, we show a sufficient condition to get the global existence of the solution for problem nonlinear damped wave equations.

Compressible Euler–Maxwell limit for global smooth solutions to the Vlasov–Maxwell–Boltzmann system

Two fundamental models in plasma physics are given by the Vlasov–Maxwell–Boltzmann system and the compressible Euler–Maxwell system which both capture the complex dynamics of plasmas under the self-consistent electromagnetic interactions at the kinetic and fluid levels, respectively. It has remained a long-standing open problem to rigorously justify the hydrodynamic limit from the former to the latter as the Knudsen number [Formula: see text] tends to zero. In this paper, we give an affirmative answer to the problem for smooth solutions to both systems near constant equilibrium in the whole space in case when only the dynamics of electrons is taken into account. The explicit rate of convergence in [Formula: see text] over an almost global time interval is also obtained for well-prepared data. For the proof, one of main difficulties occurs to the cubic growth of large velocities due to the action of the classical transport operator on local Maxwellians and we develop new [Formula: see text]-dependent energy estimates basing on the macro–micro decomposition to characterize the asymptotic limit in the compressible setting.

On the circular numerical range of 5-by-5 partial isometries

We prove, in some cases in terms of kippenhahn curve, that if 5-by-5 partial isometry whose numerical range is a circular disc then its center must be the origin. This gives a partial affirmative answer to Conjecture 5.1. of [H. l. Gau et al., Linear and Multilinear Algebra, 64 (1) 2016, 14–35.], for the five-dimensional case.

Order Reconfiguration under Width Constraints

In this work, we consider the following order reconfiguration problem: Given a graph $G$ together with linear orders $\omega$ and $\omega'$ of the vertices of $G$, can one transform $\omega$ into $\omega'$ by a sequence of swaps of adjacent elements in such a way that, at each time step, the resulting linear order has cutwidth (pathwidth) at most $k$? We show that this problem always has an affirmative answer when the input linear orders $\omega$ and $\omega'$ have cutwidth (pathwidth) of at most $k/2$. This result also holds in a weighted setting. Using this result, we establish a connection between two apparently unrelated problems: the reachability problem for two-letter string rewriting systems and the graph isomorphism problem for graphs of bounded cutwidth. This opens an avenue for the study of the famous graph isomorphism problem using techniques from term rewriting theory.

The copyright protection of AI-generated works under Chinese law

Who is the author of a work generated by AI? Can AI-generated works be protected by copyright law? This issue has attracted global attention. The vast majority of countries in the world have given a negative response to this question, but one Chinese court has given an affirmative answer, instead. Does this Chinese decision represent future thinking for the world in this area? It is necessary to investigate the reasons behind this decision, which are related to China's special interpretation of “human participation” and the criteria for judging originality. This judicial result was also related to China's current lack of a distinction between computer-assisted and AI-generated results. In the future, China may continue to uphold the existing determination; however, since China does not operate under case law, Chinese courts may still change their opinion. Moreover, China's choice may not have an impact on countries that are deeply influenced by natural law, but it may still impact some countries that are strongly influenced by utilitarianism.

Parametric topological entropy of families of multivalued maps in topological spaces and induced hyperspace maps

A positive parametric topological entropy is examined whether or not it is preserved from given continuous maps to the induced hyperspace maps. An established affirmative answer generalizes all the related results obtained in this field so far, because the continuous maps under consideration can be multivalued and nonautonomous (time-dependent) in compact topological Hausdorff spaces. A variety of definitions of parametric topological entropy for multivalued maps is investigated, together with their properties. Several simple illustrative examples are supplied.

On the Burness-Giudici conjecture

Let G be a permutation group on a set . A subset of is a base for G if its pointwise stabilizer in G is trivial. By b(G) we denote the size of the smallest base of G. Every permutation group with b(G) = 2 contains some regular suborbits. It is conjectured by Burness-Giudici that every primitive permutation group G with b(G) = 2 has the property that if then , where Γ is the union of all regular suborbits of G relative to α. An affirmative answer of the conjecture has been shown for many sporadic simple groups and some alternating groups, but it is still open for simple groups of Lie-type. The first candidate of an infinite family of simple groups of Lie-type we should work on might be , where . In this manuscript, we show the correctness of the conjecture for all the primitive groups with socle , see Theorem 1.3.

Захист комп’ютерного програмного забезпечення в системі авторського права

Software development in recent decades has demonstrated a pace of change not seen since the Industrial Revolution. Software affects almost every aspect of human life in all parts of the world. From an intellectual property rights perspective, discourse and debate focus not only on how software should be protected, but also on a host of issues that reflect the many aspects that software plays in the digital distribution of creative content. A further issue concerning the concept of “computer program” is whether the images generated on screens as a result of the operation of a program (for example, in the case of video games) may or should be regarded as parts of a “computer program”. It is possible to find certain views according to which an affirmative answer should be given to this question, and such views have been accepted exceptionally even at the level of national legislation, but the dominant opinion, as well as the dominant position under national laws, is that the images generated by a computer program in the form of screen display go beyond the concept of computer programs proper. The concept of “computer program” under Article 4 of the WCT also does not extend to the images generated by computer programs on screens. Until recently, unauthorized copying of software required the physical exchange of floppy disks, CDs, or other hard media. But software piracy has become much easier with the spread of the Internet, becoming faster and cheaper. The Internet allows products to move from computer to computer without transactions on hard media and with little risk of detection. Some piracy schemes may even involve computers without the owner's knowledge. Piracy that once required understanding complex computer codes can now be done with the click of a mouse on peer-to-peer networks, through mail-order and auction sites, newsgroups, or even as simple email attachments. Strong action at the local, national and international levels is needed to counter these dangerous trends.

Answer to a question by A. Mandarino, T. Linowski and K. Życzkowski

A recent work by Mandarino, Linowski and Życzkowski left open the following question. If [Formula: see text] is a certain permutation of entries of an [Formula: see text] matrix (“mixing map”) and [Formula: see text] is an [Formula: see text] Haar unitary random matrix, then is the family [Formula: see text] asymptotically free? (Here by [Formula: see text] we understand the matrix resulted by permuting the entries of [Formula: see text] according to the permutation [Formula: see text].) This paper presents some techniques for approaching such problems. In particular, one easy consequence of the main result is that the question above has an affirmative answer.

Boosting Simple Learners

Boosting is a celebrated machine learning approach which is based on the idea of combining weak and moderately inaccurate hypotheses to a strong and accurate one. We study boosting under the assumption that the weak hypotheses belong to a class of bounded capacity. This assumption is inspired by the common convention that weak hypotheses are "rules-of-thumbs" from an "easy-to-learn class". (Schapire and Freund~'12, Shalev-Shwartz and Ben-David '14.) Formally, we assume the class of weak hypotheses has a bounded VC dimension. We focus on two main questions: (i) Oracle Complexity: How many weak hypotheses are needed to produce an accurate hypothesis? We design a novel boosting algorithm and demonstrate that it circumvents a classical lower bound by Freund and Schapire ('95, '12). Whereas the lower bound shows that $\Omega({1}/{\gamma^2})$ weak hypotheses with $\gamma$-margin are sometimes necessary, our new method requires only $\tilde{O}({1}/{\gamma})$ weak hypothesis, provided that they belong to a class of bounded VC dimension. Unlike previous boosting algorithms which aggregate the weak hypotheses by majority votes, the new boosting algorithm uses more complex ("deeper") aggregation rules. We complement this result by showing that complex aggregation rules are in fact necessary to circumvent the aforementioned lower bound. (ii) Expressivity: Which tasks can be learned by boosting weak hypotheses from a bounded VC class? Can complex concepts that are "far away" from the class be learned? Towards answering the first question we {introduce combinatorial-geometric parameters which capture expressivity in boosting.} As a corollary we provide an affirmative answer to the second question for well-studied classes, including half-spaces and decision stumps. Along the way, we establish and exploit connections with Discrepancy Theory.

Saying Everything

Abstract: Can one "know everything"? In the past, there were people who came close to doing so, but it seems impossible to have contemporaries who know everything. Certainly, some texts aspire to "say everything"; and the French expression tout dire has a venerable history. Yet saying everything is not the same as polymathy. Can texts, however, be polymaths? A case for an affirmative answer to the question is made by way of passive constitution.

Asymptotic behavior of solutions for a new general class of parabolic Kirchhoff type equation with variable exponent sources

In this paper, we study the following problem:{ut−M(∫Ω|∇u|p(x)p(x)dx)Δp(x)u=|u|m(x)−2u,(x,t)∈Ω×(0,T),u(x,t)=0,(x,t)∈∂Ω×(0,T),u(x,0)=u0(x),x∈Ω, where Ω⊂RN is a bounded domain with smooth boundary ∂Ω, the functions p,m:Ω¯→R and the Kirchhoff function M:[0,∞)→[0,∞) are specified below. We give a new class of general Kirchhoff function which covers both non-degenerate and degenerate cases, and investigate its effects on the existence and non-existence of global weak solutions to the problem in case the initial energy is subcritical. Moreover, we also give the decay estimate for the energy functional in the former case and an upper bound for the maximal existence time in the latter case. This is a continue works by Nhan et al. (2020) [27] and also an affirmative answer for the comments by Guo et al. (2022) [13].

On the property (C) of Corson and other sequential properties of Banach spaces

A well-known result of R. Pol states that a Banach space X has property (C) of Corson if and only if every point in the weak*-closure of any convex set C⊆BX⁎ is actually in the weak*-closure of a countable subset of C. Nevertheless, it is an open problem whether this is in turn equivalent to the countable tightness of BX⁎ with respect to the weak*-topology. Frankiewicz, Plebanek and Ryll-Nardzewski provided an affirmative answer under MA+¬CH for the class of C(K)-spaces. In this article we provide a partial extension of this latter result by showing that under the Proper Forcing Axiom (PFA) the following conditions are equivalent for an arbitrary Banach space X:(1)X has property E′;(2)X has weak*-sequential dual ball;(3)X has property (C) of Corson;(4)(BX⁎,w⁎) has countable tightness. This provides a partial extension of a former result of Arhangel'skii. In addition, we show that every Banach space with property E′ has weak*-convex block compact dual ball.

Banach’s isometric subspace problem in dimension four

We prove that if all intersections of a convex body $B\subset \mathbb{R}^{4}$ with 3-dimensional linear subspaces are linearly equivalent then $B$ is a centered ellipsoid. This gives an affirmative answer to the case $n=3$ of the following question by Banach from 1932: Is a normed vector space $V$ whose $n$ -dimensional linear subspaces are all isometric, for a fixed $2 \le n< \dim V$ , necessarily Euclidean? The dimensions $n=3$ and $\dim V=4$ is the first case where the question was unresolved. Since the 3-sphere is parallelizable, known global topological methods do not help in this case. Our proof employs a differential geometric approach.

Analytic aspects of generalized central trinomial coefficients

The divisibility and congruence of usual and generalized central trinomial coefficients have been extensively investigated. The present paper is devoted to analytic properties of these numbers. We show that usual central trinomial polynomials Tn(x) have only real roots, and roots of Tn(x) interlace those of Tn+1(x), as well as those of Tn+2(x), which gives an affirmative answer to an open question of Fisk. We establish necessary and sufficient conditions such that the generalized central trinomial coefficients Tn(b,c) form a log-convex sequence or a Stieltjes moment sequence.

On the structure of connected components of the moduli spaces of compact Riemann surfaces

Using the Broughton’s equisymmetric stratification of the moduli space of compact Riemann surfaces of genus g ge 2, Bartolini, Costa and Izquierdo have shown that its singular locus S_{g} is disconnected except for g = 3, 4, 7, 13, 17, 19, 59. One of a lot of problems motivated by this result concerns the study of its connected components, both from the quantitative and qualitative points of view. In 2012, Bartolini and Izquierdo have shown that all strata corresponding to the actions of Z_{2} and Z_{3} are contained in a single connected component C^{2,3}_g. The other components which were known to these authors were those composed by single strata and they asked whether there are components different from C^{2,3}_ g being the union at least two equisymmetric strata. The aim of this paper is to give an affirmative answer to this question, by showing that there are connected components composed of precisely two strata in S_{g} for g = rp(p -1)/2 where r ge 6 and p > 5r + 3 is a prime for which pr + 2 is also a prime.