bluuebunny/crossref_metadata_2025 huggingface dataset:
On the ${\cal S}_{n}$-Modules Generated by Partitions of a Given Shape
Authors: Kane Daniel , Sivek Steven
Published: January 2020

Given a Young diagram $\lambda$ and the set $H^{\lambda}$ of partitions of $\{1,2,\dots$, $|\lambda|\}$ of shape $\lambda$, we analyze a particular ${\cal S}_{|\lambda|}$-module homomorphism ${\Bbb Q}H^{\lambda}\to{\Bbb Q}H^{\lambda'}$ to show that ${\Bbb Q}H^{\lambda}$ is a submodule of ${\Bbb Q}H^{\lambda'}$ whenever $\lambda$ is a hook $(n,1,1,\dots,1)$ with $m$ rows, $n\geq m$, or any diagram with two rows.
Character Polynomials, their q-Analogs and the Kronecker Product
Authors: Garsia A. M. , Goupil A.
Published: January 2020

The numerical calculation of character values as well as Kronecker coefficients can efficently be carried out by means of character polynomials. Yet these polynomials do not seem to have been given a proper role in present day literature or software. To show their remarkable simplicity we give here an "umbral" version and a recursive combinatorial construction. We also show that these polynomials have a natural counterpart in the standard Hecke algebra ${\cal H}_n(q\, )$. Their relation to Kronecker products is brought to the fore, as well as special cases and applications. This paper may also be used as a tutorial for working with character polynomials in the computation of Kronecker coefficients.
An Algorithmic Friedman–Pippenger Theorem on Tree Embeddings and Applications
Authors: Dellamonica Jr Domingos , Kohayakawa Yoshiharu
Published: January 2020

An $(n, d)$-expander is a graph $G = (V, E)$ such that for every $X \subseteq V$ with $|X| \leq 2n - 2$ we have $|\Gamma_G(X)| \geq (d+1)|X|$. A tree $T$ is small if it has at most $n$ vertices and has maximum degree at most $d$. Friedman and Pippenger (1987) proved that any $(n, d)$-expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs $G$ of $(N,D,\lambda)$-graphs $\Lambda$, as long as $G$ contains a positive fraction of the edges of $\Lambda$ and $\lambda/D$ is small enough. In several applications of the Friedman–Pippenger theorem, including the ones in the original paper of those authors, the $(n,d)$-expander $G$ is a subgraph of an $(N,D,\lambda)$-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman–Pippenger theorem. We shall also show a construction inspired on Wigderson–Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).
Generalisations of the Tits Representation
Authors: Krammer Daan
Published: January 2020

We construct a group $K_n$ with properties similar to infinite Coxeter groups. In particular, it has a geometric representation featuring hyperplanes, simplicial chambers and a Tits cone. The generators of $K_n$ are given by $2$-element subsets of $\{0,\ldots,n\}$. We provide some generalities to deal with groups like these. We give some easy combinatorial results on the finite residues of $K_n$, which are equivalent to certain simplicial real central hyperplane arrangements.
Small Integral Trees
Authors: Brouwer A. E.
Published: January 2020

We give a table with all integral trees on at most 50 vertices, and characterize integral trees with a single eigenvalue 0.
Characterizing Cell-Decomposable Metrics
Authors: Huber Katharina T. , Koolen Jacobus , Moulton Vincent , Spillner Andreas
Published: January 2020

To a finite metric space $(X,d)$ one can associate the so called tight-span $T(d)$ of $d$, that is, a canonical metric space $(T(d),d_\infty)$ into which $(X,d)$ isometrically embeds and which may be thought of as the abstract convex hull of $(X,d)$. Amongst other applications, the tight-span of a finite metric space has been used to decompose and classify finite metrics, to solve instances of the server and multicommodity flow problems, and to perform evolutionary analyses of molecular data. To better understand the structure of $(T(d),d_\infty)$ the concept of a cell-decomposable metric was recently introduced, a metric whose associated tight-span can be decomposed into simpler tight-spans. Here we show that cell-decomposable metrics and totally split-decomposable metrics — a class of metrics commonly applied within phylogenetic analysis — are one and the same thing, and also provide some additional characterizations of such metrics.
For each $\alpha > 2$ there is an Infinite Binary Word with Critical Exponent $\alpha$
Authors: Currie James D. , Rampersad Narad
Published: January 2020

The critical exponent of an infinite word ${\bf w}$ is the supremum of all rational numbers $\alpha$ such that ${\bf w}$ contains an $\alpha$-power. We resolve an open question of Krieger and Shallit by showing that for each $\alpha > 2$ there is an infinite binary word with critical exponent $\alpha$.
Bipartite-Uniform Hypermaps on the Sphere
Authors: D'Azevedo António Breda , Duarte Rui
Published: January 2020

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that "neighbouring" hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour, hyperedges and hyperfaces, all the elements have the same valency. The flags of a bipartite hypermap are naturally 2-coloured by assigning the colour of its adjacent hypervertices. A hypermap is bipartite-regular if the automorphism group acts transitively on each set of coloured flags. If the automorphism group acts transitively on the set of all flags, the hypermap is regular. In this paper we classify the bipartite-uniform hypermaps on the sphere (up to duality). Two constructions of bipartite-uniform hypermaps are given. All bipartite-uniform spherical hypermaps are shown to be constructed in this way. As a by-product we show that every bipartite-uniform hypermap ${\cal H}$ on the sphere is bipartite-regular. We also compute their irregularity group and index, and also their closure cover ${\cal H}^{\Delta}$ and covering core ${\cal H}_{\Delta}$.
Consistent Cycles in $1\over2$-Arc-Transitive Graphs
Authors: Boben Marko , Miklavič Štefko , Potočnik Primož
Published: January 2020

A directed cycle $C$ of a graph is called $1\over k$-consistent if there exists an automorphism of the graph which acts as a $k$-step rotation of $C$. These cycles have previously been considered by several authors in the context of arc-transitive graphs. In this paper we extend these results to the case of graphs which are vertex-transitive, edge-transitive but not arc-transitive.
A Two Parameter Chromatic Symmetric Function
Authors: Williams Ellison-Anne
Published: January 2020

We introduce and develop a two-parameter chromatic symmetric function for a simple graph $G$ over the field of rational functions in $q$ and $t,\,{\Bbb Q}(q,t)$. We derive its expansion in terms of the monomial symmetric functions, $m_{\lambda}$, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete graph $G$ of order $n$, its corresponding two-parameter chromatic symmetric function is the Macdonald polynomial $Q_{(n)}$. Using this, we develop graphical analogues for the expansion formulas of the two-row Macdonald polynomials and the two-row Jack symmetric functions. Finally, we introduce the "complement" of this new function and explore some of its properties.
Statistics on the Multi-Colored Permutation Groups
Authors: Bagno Eli , Butman Ayelet , Garber David
Published: January 2020

We define an excedance number for the multi-colored permutation group i.e. the wreath product $({\Bbb Z}_{r_1} \times \cdots \times {\Bbb Z}_{r_k}) \wr S_n$ and calculate its multi-distribution with some natural parameters. We also compute the multi–distribution of the parameters exc$(\pi)$ and fix$(\pi)$ over the sets of involutions in the multi-colored permutation group. Using this, we count the number of involutions in this group having a fixed number of excedances and absolute fixed points.
Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups
Authors: Ku Cheng Yeaw , Wong Tony W. H.
Published: January 2020

Let $S_{n}$ denote the symmetric group on $[n]=\{1, \ldots, n\}$. A family $I \subseteq S_{n}$ is intersecting if any two elements of $I$ have at least one common entry. It is known that the only intersecting families of maximal size in $S_{n}$ are the cosets of point stabilizers. We show that, under mild restrictions, analogous results hold for the alternating group and the direct product of symmetric groups.
A Bijection on Dyck Paths and its Cycle Structure
Authors: Callan David
Published: January 2020

The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each cycle has length a power of 2. A new manifestation of the Catalan numbers as labeled forests crops up en route as does the Pascal matrix mod 2. We use the bijection to show the equivalence of two known manifestations of the Motzkin numbers. Finally, we consider some statistics on the new Catalan manifestation and the identities they interpret.
Distinguishability of Locally Finite Trees
Authors: Watkins Mark E. , Zhou Xiangqian
Published: January 2020

The distinguishing number $\Delta(X)$ of a graph $X$ is the least positive integer $n$ for which there exists a function $f:V(X)\to\{0,1,2,\cdots,n-1\}$ such that no nonidentity element of $\hbox{Aut}(X)$ fixes (setwise) every inverse image $f^{-1}(k)$, $k\in\{0,1,2,\cdots,n-1\}$. All infinite, locally finite trees without pendant vertices are shown to be 2-distinguishable. A proof is indicated that extends 2-distinguishability to locally countable trees without pendant vertices. It is shown that every infinite, locally finite tree $T$ with finite distinguishing number contains a finite subtree $J$ such that $\Delta(J)=\Delta(T)$. Analogous results are obtained for the distinguishing chromatic number, namely the least positive integer $n$ such that the function $f$ is also a proper vertex-coloring.
Intersecting Systems of Signed Sets
Authors: Borg Peter
Published: January 2020

A family ${\cal F}$ of sets is said to be (strictly) EKR if no non-trivial intersecting sub-family of ${\cal F}$ is (as large as) larger than some trivial intersecting sub-family of ${\cal F}$. For a finite set $X := \{x_1, ..., x_{|X|}\}$ and an integer $k \geq 2$, we define ${\cal S}_{X,k}$ to be the family of signed sets given by $${\cal S}_{X,k} := \Big\{\big\{(x_1,a_1), ..., (x_{|X|},a_{|X|})\big\} \colon a_i \in [k], i = 1, ..., |X|\Big\}.$$ For a family ${\cal F}$, we define ${\cal S}_{{\cal F},k} := \bigcup_{F \in {\cal F}}{\cal S}_{F,k}$. We conjecture that for any ${\cal F}$ and $k \geq 2$, ${\cal S}_{{\cal F},k}$ is EKR, and strictly so unless $k=2$ and ${\cal F}$ has a particular property. A well-known result (stated by Meyer and proved in different ways by Deza and Frankl, Engel, Erdős et al., and Bollobás and Leader) supports this conjecture for ${\cal F} = {[n] \choose r}$. The main theorem in this paper generalises this result by establishing the truth of the conjecture for families ${\cal F}$ that are compressed with respect to some $f^* \in \bigcup_{F \in {\cal F}}F$ (i.e. $f \in F \in {\cal F}, f^* \notin F \Rightarrow (F \backslash \{f\}) \cup \{f^*\} \in {\cal F}$). We also confirm the conjecture for families ${\cal F}$ that are uniform and EKR.
Information Flows, Graphs and their Guessing Numbers
Authors: Riis Søren
Published: January 2020

Valiant's shift problem asks whether all $n$ cyclic shifts on $n$ bits can be realized if $n^{(1+\epsilon)}$ input output pairs ($\epsilon < 1$) are directly connected and there are additionally $m$ common bits available that can be arbitrary functions of all the inputs. If it could be shown that this is not realizable with $m = O({n\over \log \log n})$ common bits then a significant breakthrough in Boolean circuit complexity would follow. In this paper it is shown that in certain cases all cyclic shifts are realizable with $m=(n- n^{\epsilon})/2$ common bits. Previously, no solution with $m < n - o(n)$ was known, and Valiant had conjectured that $m < n/2$ was not achievable. The construction therefore establishes a novel way of realizing communication in the manner of Network Coding for the shift problem, but leaves the viability of the common information approach to proving lower bounds in Circuit Complexity open. The construction uses the graph-theoretic notion of guessing number. As a by-product the paper also establish an interesting link between Circuit Complexity and Network Coding, a new direction of research in multiuser information theory.
Robinson-Schensted Correspondence for the Signed Brauer Algebras
Authors: Parvathi M. , Tamilselvi A.
Published: January 2020

In this paper, we develop the Robinson-Schensted correspondence for the signed Brauer algebra. The Robinson-Schensted correspondence gives the bijection between the set of signed Brauer diagrams $d$ and the pairs of standard bi-dominotableaux of shape $\lambda=(\lambda_1,\lambda_2)$ with $\lambda_1=(2^{2f}),\lambda_2 \in \overline{\Gamma}_{f,r}$ where $\overline{\Gamma}_{f,r}=\{ \lambda | \lambda\vdash 2(n-2f)+|\delta_r| {\rm \ whose } \ 2{\rm-core \ is \ \delta_r, \ } \delta_r=(r,r-1,\ldots,1,0)\}$, for fixed $r\geq 0$ and $0\leq f \leq \left[{n\over 2}\right]$. We also give the Robinson-Schensted for the signed Brauer algebra using the vacillating tableau which gives the bijection between the set of signed Brauer diagrams ${\overline{V}_n}$ and the pairs of $d$-vacillating tableaux of shape $\lambda \in \overline{\Gamma}_{f,r}$ and $0\leq f \leq \left[{n\over 2}\right]$. We derive the Knuth relations and the determinantal formula for the signed Brauer algebra by using the Robinson-Schensted correspondence for the standard bi-dominotableau whose core is $\delta_{r}$, $r \geq n-1$.
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
Authors: Kolman Petr , Waleń Tomasz
Published: January 2020

In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computational biology but related problems appear in many other areas of computer science. Particular attention has been given to the problem of sorting by reversals (SBR): given two strings, $A$ and $B$, find the minimum number of reversals that transform the string $A$ into the string $B$ (a reversal $\rho(i,j)$, $i < j$, transforms a string $A=a_1\ldots a_n$ into a string $A'=a_1\ldots a_{i-1} a_{j} a_{j-1} \ldots a_{i} a_{j+1} \ldots a_n$). Closely related is the minimum common string partition problem (MCSP): given two strings, $A$ and $B$, find a minimum size partition of $A$ into substrings $P_1,\ldots,P_l$ (i.e., $A=P_1\ldots P_l$) and a partition of $B$ into substrings $Q_1,\ldots,Q_l$ such that $(Q_1,\ldots,Q_l)$ is a permutation of $(P_1,\ldots,P_l)$. Primarily the SBR problem has been studied for strings in which every symbol appears exactly once (that is, for permutations) and only recently attention has been given to the general case where duplicates of the symbols are allowed. In this paper we consider the problem $k$-SBR, a version of SBR in which each symbol is allowed to appear up to $k$ times in each string, for some $k\geq 1$. The main result of the paper is a $\Theta(k)$-approximation algorithm for $k$-SBR running in time $O(n)$; compared to the previously known algorithm for $k$-SBR, this is an improvement by a factor of $\Theta(k)$ in the approximation ratio, and by a factor of $\Theta(k)$ in the running time. We approach the $k$-SBR by finding an approximation for the $k$-MCSP first and then turning it into a solution for $k$-SBR. Crucial ingredients of our algorithm are the suffix tree data structure and a linear time algorithm for a special case of a disjoint set union problem.
On Mixed Codes with Covering Radius $1$ and Minimum Distance $2$
Authors: Haas Wolfgang , Quistorff Jörn
Published: January 2020

Let $R$, $S$ and $T$ be finite sets with $|R|=r$, $|S|=s$ and $|T|=t$. A code $C\subset R\times S\times T$ with covering radius $1$ and minimum distance $2$ is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal cardinality $K(r,s,t;2)$. These bounds turn out to be best possible in many instances. Focussing on the special case $t=s$ we determine $K(r,s,s;2)$ when $r$ divides $s$, when $r=s-1$, when $s$ is large, relative to $r$, when $r$ is large, relative to $s$, as well as $K(3r,2r,2r;2)$. Some open problems are posed. Finally, a table with bounds on $K(r,s,s;2)$ is given.
The Block Connectivity of Random Trees
Authors: McGrae Andrew R. A. , Zito Michele
Published: January 2020

Let $r$, $m$, and $n$ be positive integers such that $rm=n$. For each $i \in \{1, \ldots, m\}$ let $B_i = \{r(i-1)+1, \ldots, ri\}$. The $r$-block connectivity of a tree on $n$ labelled vertices is the vertex connectivity of the graph obtained by collapsing the vertices in $B_i$, for each $i,$ to a single (pseudo-)vertex $v_i$. In this paper we prove that, for fixed values of $r$, with $r \geq 2$, the $r$-block connectivity of a random tree on $n$ vertices, for large values of $n$, is likely to be either $r-1$ or $r$, and furthermore that $r-1$ is the right answer for a constant fraction of all trees on $n$ vertices.
Matrix Partitions with Finitely Many Obstructions
Authors: Feder Tomás , Hell Pavol , Xie Wing
Published: January 2020

Each $m$ by $m$ symmetric matrix $M$ over $0, 1, *$, defines a partition problem, in which an input graph $G$ is to be partitioned into $m$ parts with adjacencies governed by $M$, in the sense that two distinct vertices in (possibly equal) parts $i$ and $j$ are adjacent if $M(i,j)=1$, and nonadjacent if $M(i,j)=0$. (The entry $*$ implies no restriction.) We ask which matrix partition problems admit a characterization by a finite set of forbidden induced subgraphs. We prove that matrices containing a certain two by two diagonal submatrix $S$ never have such characterizations. We then develop a recursive technique that allows us (with some extra effort) to verify that matrices without $S$ of size five or less always have a finite forbidden induced subgraph characterization. However, we exhibit a six by six matrix without $S$ which cannot be characterized by finitely many induced subgraphs. We also explore the connection between finite forbidden subgraph characterizations and related questions on the descriptive and computational complexity of matrix partition problems.
Asymptotics of the Average Height of $2$–Watermelons with a Wall
Authors: Fulmek Markus
Published: January 2020

We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length $n$) to the case of $p$–watermelons with a wall (i.e., to a certain family of $p$ nonintersecting Dyck paths; simple Dyck paths being the special case $p=1$.) An exact enumeration formula for the average height is easily obtained by standard methods and well–known results. However, straightforwardly computing the asymptotics turns out to be quite complicated. Therefore, we work out the details only for the simple case $p=2$.
On the Locality of the Prüfer Code
Authors: Lennon Craig
Published: January 2020

The Prüfer code is a bijection between trees on the vertex set $[n]$ and strings on the set $[n]$ of length $n-2$ (Prüfer strings of order $n$). In this paper we examine the 'locality' properties of the Prüfer code, i.e. the effect of changing an element of the Prüfer string on the structure of the corresponding tree. Our measure for the distance between two trees $T$ and $T^*$ is $\Delta(T,T^*)=n-1-\vert E(T)\cap E(T^*)\vert$. We randomly mutate the $\mu$th element of the Prüfer string of the tree $T$, changing it to the tree $T^*$, and we asymptotically estimate the probability that this results in a change of $\ell$ edges, i.e. $P(\Delta=\ell\, \vert \, \mu).$ We find that $P(\Delta=\ell\, \vert \, \mu)$ is on the order of $ n^{-1/3+o(1)}$ for any integer $\ell>1,$ and that $P(\Delta=1\, \vert \, \mu)=(1-\mu/n)^2+o(1).$ This result implies that the probability of a 'perfect' mutation in the Prüfer code (one for which $\Delta(T,T^*)=1$) is $1/3.$
Extremal Subsets of $\{1,...,n\}$ Avoiding Solutions to Linear Equations in Three Variables
Authors: Hegarty Peter
Published: January 2020

We refine previous results to provide examples, and in some cases precise classifications, of extremal subsets of $\{1,...,n\}$ containing no solutions to a wide class of non-invariant, homogeneous linear equations in three variables, i.e.: equations of the form $ax+by=cz$ with $a+b \neq c$.
On Small Dense Sets in Galois Planes
Authors: Giulietti M.
Published: January 2020

This paper deals with new infinite families of small dense sets in desarguesian projective planes $PG(2,q)$. A general construction of dense sets of size about $3q^{2/3}$ is presented. Better results are obtained for specific values of $q$. In several cases, an improvement on the best known upper bound on the size of the smallest dense set in $PG(2,q)$ is obtained.
Sea Water Activated Magnesium-Air Reserve Batteries: Calculation of Specific Energy and Energy Density for Various Cell Geometries
Authors: Lowy Daniel , Mátyás Bence
Published: January 2020

We address sustainable energy issues via scrutinizing magnesium-air reserve batteries. Such energy storage systems can hold their energy indefinitely, releasing it on demand, in emergency situations. Main advantage of water-activated batteries is that their electrolyte is supplied by the environment, where they get deployed, hence, only light weight electrodes and battery frames should be transported, rather than the significantly heavier aqueous electrolyte. Recent literature in the field is reviewed. One merit of this account is that recently, battery storage has become an effective way to increase share of renewables in photovoltaic energy systems utilized in farming. While the specific energy of reserve batteries can be determined unequivocally, their energy density calculation needs a clear definition of the considered battery volume. Therefore, this paper proposes a new modality of evaluating specific energy and energy density of seawater-activated metal-air reserve batteries for prismatic and cylindrical geometries, respectively.
Neutralizing Free Choice Items via Maximal Domain Restriction: Farsi -i Indefinites
Authors: Alonso-Ovalle Luis , Moghiseh Esmail
Published: January 2020

This paper identifies two types of free choice items (FCIs) in Farsi: yek-i DPs and har -i DPs. Their distribution and interpretation pose a puzzle: yek -i DPs pattern with other existential FCIs, and har -i DPs with other universal FCIs, but both items lose their prototypical FCI behavior when they combine with the accusative marker -ro. The paper shows that the loss of FCI behavior follows from an alternative-based analysis of FCIs (Chierchia 2013) under some assumptions about the semantic effect of -ro. The analysis parallels the explanation for the loss of FCI status of Spanish algunos presented in Alonso-Ovalle & Menéndez-Benito 2011 in that it also relies on the derivation of alternatives that are equivalent to the assertion, hence not excludable.
Penser les rapports familles-institutions, enjeux d’une recherche-action : déconstruire les injonctions paradoxales, instaurer la triangulation
Authors: Montandon Christiane , Schwartz Agnès , Maurin Souvignet Aurélie
Published: January 2020

Cet article est le fruit des premières analyses et des premiers résultats d’une recherche-action intitulée « Penser les rapports familles-institutions : enjeux de la parentalité contemporaine », et portée par une équipe pluriprofessionnelle, multisite et plurigénérationnelle. Deux volets cliniques de ce travail nous permettent de développer la spécificité de notre démarche de médiation, dans le contexte particulier des liens, des relations et des rapports entre famille et institution en ce qu’ils sont marqués par la confusion et par les injonctions paradoxales.
Familles et institution, entre entente et mésentente
Authors: Eiguer Alberto
Published: January 2020

Les conflits entre famille et institution de soin peuvent affecter la qualité des prises en charge. Le soignant risque de se sentir désorienté quant à ses objectifs – au sens de sa fonction – et à ses compétences. Pour étudier ces difficultés, l’auteur a recours aux idées de groupe et notamment de groupe analytique « opératoire » selon E. Pichon-Rivière : l’idée de tâche et celle de fantasmes partagés sont explorées ainsi qu’un fantasme spécifique, celui du vol d’enfant. Aussi bien les membres de la famille que les acteurs institutionnels en sont animés, la famille redoutant que ceux-ci se proposent de les « remplacer » auprès de l’enfant ; et ceux-ci imaginant qu’« ils peuvent faire mieux qu’eux ». Sont analysés ensuite les liens entre ce fantasme et ceux de scène primitive et de roman familial. La thérapie familiale psychanalytique ( tfp) permet d’aborder ces difficultés entre famille et institution devenant tampon, régulation et facteur de dépassement. Un cas de tfp illustre ces propos.
L’homoparentalité du point de vue de l’enfant : réflexions psychanalytiques
Authors: Veuillet-Combier Claudine
Published: January 2020

Cet article propose une réflexion psychodynamique centrée sur la clinique des familles homoparentales, à partir de données recueillies lors d’une étude nationale française. Après avoir identifié les enjeux du débat psychanalytique à ce propos, il s’en écarte pour signaler les spécificités, non pathologiques, du travail psychique mobilisé chez les parents de même sexe et leurs enfants. Enfin, pour illustration clinique, il présente le cas de jumeaux nés par gpa , avec l’analyse du dessin de famille, du cat , de l’arbre généalogique, en soulignant la logique subjective du travail de création psychique autour des enjeux de différenciation.
Tout n’est pas traumatisme. Problèmes posés par un diagnostic extensif
Authors: Rizet Clément
Published: January 2020

Tout n’est pas traumatique, or des dispositifs créés à la base pour prendre en charge les personnes souffrant de traumatisme psychique (voire de pertes entraînant un travail de deuil) étendent leurs interventions à des problématiques qui ne sont pas traumatiques. De plus, des réseaux alliant souvent de nombreux bénévoles s’emparent de ces pratiques extensives. Le présent article se donne pour but de ramener à sa juste mesure la question du trauma psychique et de souligner quelles sont les compétences professionnelles à solliciter exclusivement. On y insistera sur ce qu’est et ce que n’est pas le traumatisme psychique.
La relation à l’objet dans la clinique de la grande précarité : une approche transversale
Authors: Humphreys Derek , Tsoni Evangelia , Pawlik Claude
Published: January 2020

Cette réflexion sur le statut de l’objet se fait à partir de l’expérience clinique d’une équipe mobile de psychologues travaillant auprès des sujets migrants. Intéressés par les possibilités créatives de cette clinique, nous abordons la complexité du rapport à l’autre dans la grande précarité, lorsque seulement quelques rencontres fortuites semblent possibles. Le symptôme, dans son lien à un désir impossible pour le sujet en grande précarité, nous permet de renverser un désir gelé. Aussi, dans l’attention ici portée aux parcours des sujets errants et aux choses qu’ils portent, nous questionnons les modes habituels d’échange dans la culture. Cette ouverture considère une dimension anthropologique, historique et culturelle des liens entre un sujet et ses « trajets ».
La bibliothèque du Tasse : problèmes interprétatifs et solutions éditoriales
Authors: Tomasi Franco
Published: January 2020

L’article se propose d’analyser les pratiques de lectures du Tasse telles qu’il est possible de les reconstituer à partir des ouvrages annotés par l’auteur. Il met en évidence le rapport très étroit qui unit ce dernier à sa bibliothèque, conçue non seulement comme un refuge idéal, mais aussi comme un instrument de travail concret permettant à l’auteur de mettre en œuvre une union expérimentale entre poésie et philosophie, notamment au cours de la deuxième phase de sa production. En second lieu, l’article analyse les solutions philologiques adoptées par les responsables scientifiques des différentes éditions des volumes annotés du Tasse, en partant du principe que la valorisation de sa bibliothèque constitue un passage obligé pour une meilleure compréhension des textes qu’il composa entre la seconde moitié des années 1580 et sa mort.
Les Fiancés de Manzoni : radiographie d’un texte en mouvement
Authors: Raboni Giulia
Published: January 2020

Cette étude présente les étapes de la longue gestation des Fiancés, en prêtant une attention particulière au « Second manuscrit » du roman, édité pour la première fois en 2016 et dont la situation textuelle complexe est mise en évidence : en « amont », ce manuscrit intègre matériellement certains documents de la première rédaction du roman, dont il réutilise de nombreuses pages ; en « aval », il entretient un lien direct avec la révision des feuilles préparées par le copiste pour la censure, avec le début de l’impression et la correction des épreuves. Il s’agit donc d’un texte en mouvement qui implique que l’on en donne une interprétation non pas globale mais mise en regard avec les autres phases rédactionnelles du roman ; malgré cela, la publication intégrale de ce second brouillon, auparavant relégué dans les notes de l’édition princeps du roman, a permis de mieux percevoir la lente et pragmatique transformation des choix linguistiques de Manzoni jusqu’à l’édition de 1827 et de saisir les prémices de la crise du rapport entre vérité et vraisemblable qui ne sera explicitée publiquement que dans les années 1850 avec la parution de l’essai Sur le roman historique, une crise dont les indices significatifs sont la mise à l’écart puis la récriture de l’Histoire de la colonne infâme.
Consultant-Client relationships
Authors: Mackintosh R. G.J.
Published: January 2020

Corporations in South Africa are increasingly making use of specialist consultancy services - to help to solve problems concerning personnel, management, financial control, information systems, and so on. Company management is clearly concerned with making the best use of this expensive resource. This involves choosing the right consultancy style for the specific problem at hand, and ensuring that the type of consultant-intervention matches the stage of the organization's life-cycle. A synthesis of some related studies indicated the distinct possibility or a correlation between the stage in the organization's life-cycle, the dominant problem the organization experiences, and the major form of intervention which would be required to resolve the problem. There is a need for empirical work on, and practical application of this approach, which could lead to useful insight in the interests of more effective consultation.Maatskappye in Suid-Afrika maak toenemend gebruik van die konsultantdienste van spesialiste om probleme met betrekking tot personeel, algemene bestuur, finansiele beheer, inligtingstelsels en so meer, te help oplos. Die maatskappybestuur is duidelik besorg daaroor dat hulle die beste gebruik van hierdie duur hulpbron moet maak. Dit beteken dat die regte konsultasie-styl vir die spesifieke probleem wat ondersoek word, gekies moet word. Die tipe konsultasie-tussentrede moet ook pas by die stadium van sy lewensiklus waarin die onderneming hom bevind. 'n Sintese van 'n aantal verwante studies dui die besliste moontlikheid aan van 'n korrelasie tussen die stadium in 'n organisasie se lewensiklus, die dominante probleme wat die onderneming ondervind, en die belangrikste vorm van konsultasietussentrede wat benodig sou word om die besondere probleem op te los. Daar bestaan 'n behoefte aan empiriese,werk oor en praktiese toepassing van hierdie benadering wat nuttige insig kan gee in belang van meer doeltreffende konsultasie.
In Memoriam: Professor Japie Venter
Authors: Office Editorial
Published: January 2020

No abstract available.
Problems and limitations of university management
Authors: Radel F. E.
Published: January 2020

Modern universities are under constant pressure to improve the management of their activities, because of the increasing complexity of their tasks and structure, and the demands of their fund-supplying environment. In certain ways universities are more difficult to manage than, say, the typical business enterprise: they inevitably have a dualistic decision-making and management structure (academic and administrative); and meaningful planning is handicapped by the vagueness and multiplicity of their objectives. Even within these limitations, however, much can be done to apply proven management principles to the management of universities, and the author draws on 30 years of experience in this field to give practical examples and guidelines.Moderne universiteite is gereeld onder druk om die bestuur van hulle aktiwiteite te verbeter, sowel weens die toenemende kompleksiteit van hulle take en struktuur as die eise van die omgewing wat hulle van fondse voorsien. In sekere opsigte is universiteite moeiliker om te bestuur as byvoorbeeld die tipiese sake-onderneming: hulle het onvermydelik 'n dualistiese besluitneming- en bestuurstruktuur (akademies en administratief); en betekenisvolle beplanning word beperk deur die vaagheid en veelvoudigheid van hulle doelwitte. Selfs binne hierdie beperkings kan baie egter gedoen word om bewese bestuursbeginsels toe te pas in die bestuur van universiteite, en die skrywer put uit 30 jaar ervaring op hierdie gebied om praktiese voorbeelde en riglyne te gee.
A substantial - and expanding - business involvement with South Africa makes a world of sense
Authors: Van Wyk Chris
Published: January 2020

Luncheon Speech at the Belgian-South African Chamber of Commerce, 19 June 1979, Johannesburg.
Sales promotion and the purchasing behavior of food consumers
Authors: Vigna Joselita Pancine , Mainardes Emerson Wagner
Published: January 2020

Purpose:  This study aims to identify the types of sales promotion that affect the consumer’s purchasing behavior.Design/Methodology/Approach: We conducted a survey with a sample of 235 people who reported having made food purchases due to promotional stimulus. Relationships between variables were analyzed using descriptive statistics and a multiple linear regression model.Originality/Value: This study seeks to understand the influence of sales promotions on consumer purchasing behavior in an emerging market. Past research has explored such behavior in mature markets. We opted to broaden discussions on sales promotion by studying the effect of usual types of promotions in the Brazilian market.Outcomes: The results showed that discounts motivate the acceleration of purchases, stocking and experimentation. Free samples encourage consumers to try a product they do not know about. This suggests that discounts, free samples, and prize draws all influence consumer purchasing behavior, encouraging their preference for foods that are on sale and motivating the frequency of purchased foods that use these types of promotion.Theoretical/Methodological Contributions: The study contributed theoretically by investigating different promotional types from those already investigated, observing: the promotional types that can influence, generate preference and motivate the frequency of purchase of products promoted by Brazilian consumers; stocking, purchase acceleration, product choice and brand loyalty behaviors, which can change the choice of a promotional type in a promotional campaign.
A teoria da justiça revisitada pela teoria da injustiça: democracia e direito para se falar em justiça hoje
Authors: Moller Gabriela Samrsla , Dos Santos Paulo Junior Trindade , De Marco Cristhian Magnus
Published: January 2020

As filosofias sobre a justiça preocupam-se em descrever os contornos de uma sociedade justa e os  caminhos para alcançá-la, desconsiderando os complexos contextos sociais. Em contraponto, o objetivo da pesquisa é apresentar uma “teoria das injustiças”, priorizando elementos desconsiderados pelas tradicionais filosofias da justiça, no sentido de evidenciar disparidades defendidas em nome da tradicional visão sobre justiça, como a pobreza multidimensional. As injustiças devem ser objeto de constante debate público, para que possam vir à tona, o que justifica por que grupos desconsiderem injustiças e diminuam o caráter participativo da democracia. O direito é discurso capaz de dar voz aos injustiçados, atentando-se à realidade histórico-concreta. A hipótese é a de que uma teoria da injustiça é capaz de delinear as misérias da sociedade, de forma a se definir prioridades políticas. A metodologia utilizada é desconstrutivista.
CONSUMPTION INDICATORS IN THE RESEARCH OF SOCIO-ECONOMIC DEVELOPMENT
Authors: Grzega Urszula
Published: January 2020

The measuring socio-economic development with the use of consumption indicators is an important and current focus of interest for researchers and scientists. It applies all countries, especially those, that have undergone transformation and integration changes, such as Poland. The recognition and assessment of changes in the different elements that fit into the broadly understood socio-economic development is used to verify the basic objectives of changes related to the improvement of the standard of living of people. The analysis of consumption indicators in Poland in the years 2004-2017 confirms the improvement of standard of living, and thus the progressing socio-economic development of the country. This is indicated, among other things, by positive changes in the structure of individual consumption in polish households could be observed as well. They were emphasized in the decrease of food expenditures in general expenditures, while the free choice expenditures share was increased.
DESCRIPTION OF THE PROPERTY VALUATION PROCESS IN POLISH CONDITIONS
Authors: Kuraś Piotr
Published: January 2020

The study attempts to describe the property valuation process in the context of regulations in force In Poland. For this purpose, to this end, the current legal acts, professional standards of real estate appraisers as well as institutional and economic conditions were analyzed. The study starts with the characterization of the property at the subject of valuation, the types of determined values, then the silhouette of the real estate appraiser as a professional authorized to valuation of the property was presented. The most important part of the study, from the point of view of the study goal, is the description of the process of valuation of real estate in Polish conditions. This paper presents a general valuation model, which the difficult and complex problem of valuation presents in a comprehensive, consistent and logical way. Various research approaches have been used for the purpose of the study. Qualitative approach based on observation, interview, analysis of dispersed sources allowed to formulate research assumptions. Next, methods of scientific inference were used, mainly analysis and synthesis. In the paper, due to the aim, mainly the Polish literature on the subject was used as well as legal acts and other sources of information.
ASSESSMENT OF INITIATIVES IN THE FIELD OF ECOLOGICAL CORPORATE SOCIAL RESPONSIBILITY IN THE OPINION OF YOUNG GENERATIONCONSUMERS
Authors: Krzepicka Alicja , Tarapata Jolanta
Published: January 2020

The purpose of the article is to find out the opinions of young consumers about the knowledge of the practical implementation of actions taken by enterprises on the Polish market as part of ecological corporate social responsibility and an attempt to determine the attitude of young generation consumers towards manifested actions along with the identification and analysis of good practices including range.
Theoretical aspects are described based on the analysis of selected source materials, the practical aspect was developed based on the results of pilot surveys (survey handed out) conducted by the authors in 2017 on a group of 60 consumers of the young generation (18-30 years). The results of the conducted research indicate the importance of enterprises taking initiatives in the field of ecological corporate social responsibility - 87% of responses. In the justification, young consumers usually stated: the need to save non-renewable resources, energy, water and minimize waste production. It is worth noting that an important determinant of lifestyle for representatives of the younger generation of consumers is the consumption of organic food, as well as care for the natural environment and engaging in social initiatives related to it.
MANAGEMENT OF ANIMAL TRANSPORT WITH SPECIAL ATTENTION TO ANIMAL WELFARE
Authors: Budzik Anna , Budzik Tomasz
Published: January 2020

Transport management takes into account a wide range of decisions: from defining a strategic plan to choosing the type and method of transport. The transport of live animals is a specific type of transport due to the type of “load” which is the living organism. For animals, transport, especially over long distances, carries the risk of injury and is undoubtedly a source of stress. Increased interest in the welfare of animals during transport is now an object of interest not only for animal organizations, but also business communities, animal breeders, slaughterhouses and enterprises transporting animals. The article presents and describes the requirements for managing the transport of slaughter animals, taking into account animal welfare.
STRATEGIC RENEWAL OF BUSINESS MODELS IN THE LANGUAGE SCHOOLS SEGMENT
Authors: Malara Zbigniew , Ziembicki Paweł
Published: January 2020

The paper presents the results of the third stage of the research on business models of enterprises in the language schools segment. It has an inferential-postulatory character. Results from the two previous stages were used: the first stage of the research on the assessment of the impact of the surrounding elements on selected components of a business model according to the canvas template, and the second stage of the research on the so-called activity packages. In the third stage, the packages, which have a great potential to reduce the gap were selected. Reducing the gap is referred to the renewal of the business model and its importance is connected to the relation between the business model and the strategy of an enterprise. Against this background, the postulates referred to using the concept of lean canvas and the theory of tasks to be performed for the clients. The attention was also paid to connecting the issue of the gap to the known and structured in management question of the strategic renewal of an enterprise. Two further research directions on business models of language schools segment of the case study type and referring to the assessment of the proposition by the same enterprises participating in the research (96 from Lower Silesian Voivodship) have been outlined.
COOPERATION OF ENTERPRISES FROM THE HEALTH CARE SECTOR IN THE FIELD OF INNOVATIVE ACTIVITIES WITH OTHER ENTITIES ‒ CASE STUDY OF LÓDŹ VOIVODSHIP
Authors: Kaczmarska-Krawczak Jadwiga
Published: January 2020

Innovative processes of enterprises do not depend solely on the innovative potential of building their own potential of the organization, but on the cooperation of enterprises with other entities that allow for economizing the activity (effect of the scale of operations and sharing costs and risks of initiated activities). Research shows that creating innovation in cooperation brings benefits to both individual participants of this cooperation and the entire sector.
The aim of the article is to evaluate the cooperation of enterprises from the healthcare sector in the field of innovative activities with other entities on the example of Lódź Voivodship. The main part of the study is devoted to a detailed discussion of the areas and benefits of cooperation, partners in the process of creating innovation and barriers that appear in cooperation in the creation of innovation.
CONCEPTUAL MODEL OF RESTORATION PROCESS OF DEVELOPMENT OF ENTERPRISE PERSONNEL POTENTIAL
Authors: Garmider Larysa , Lykhopok Denys Lykhopok , Bidnenko Nataliya
Published: January 2020

The article deals with the specifics and main characteristics of the personnel potential development as a social economic process on enterprise. The processes of managing formation and development of personnel, methods, forms and factors become the most important objects under the analysis of organizational component of human resources development. The formation of enterprise personnel through recruitment and hiring, training, retraining, advanced training, use of special methods of work motivation in the system of modern organization management have been considered by many foreign and domestic researches. The lack of research in the fields of conceptual approaches to the restoration process of development of enterprise personnel potential signifies the necessary investigating and summarizing the specifics and main characteristics of the personnel potential development of enterprise.
STUDENT COMPETENCES IN THE FIELD OF PROJECT RISK MANAGEMENT ON EXAMPLE OF IPMA-STUDENT PROGRAMME
Authors: Soroka-Potrzebna Hanna
Published: January 2020

Rapidity and scope of changes of the economy in global and local level is a fundamental challenge for project managers. Changes in the environment make it difficult to successfully implement many projects. Quick identification and assessment of project opportunities and threats become the key competence of the project manager.
The aim of the article is to present the level of risk management competencies among students who are certified on the IPMA-Student portal. The article uses the literature analysis of the subject as well as the analysis of data obtained from the IPMA Student exam portal.
The main research problems are:
- identification of the level of competence in risk management in projects that have certified students;
- comparison of the level of competence in risk management with other technical competences held by certified students.
The conclusions obtained are of practical significance because they enable the identification of the level of competence, which has a significant impact on the success of implemented projects. The topic discussed allows to indicate competence gaps in project risk management among students.
CREATING BRANDED COMPUTER GAME ELEMENTS AS A FORM OF CUSTOMER ENGAGEMENT
Authors: Hofman-Kohlmeyer Magdalena
Published: January 2020

Nowadays companies want to engage customers in all possible ways to better meeting their needs. New media gave managers opportunities to interact with people and establish cooperation. Present paper is aimed to give an outlook on creating branded computer game elements as a customer engagement behavior. The author carried out 20 in-depth interviews with users of three computer games: The Sims, Second Life and Euro Truck Simulator 2. The results show that players create branded game modifications with interference only into audiovisual presentation and interference in the game code. Inside the games, it can be find also a wide range of fictitious brands that replace the real one, among others for legal reason. The authors tried to answer the question why people engage in creating branded game elements. Based on some players statement during the interviews it can be assumed that players create branded elements for few reasons. They want to diversify the game, create some items as an entertainment activities, want to raise the realism of the game, need to belong to some community and also create add-ons to earn money.