Search

The process of wood debarking plays a crucial role in determining the price and quality of the final product. Hence, this work aims to elaborate on a theoretical basis for upgrading wood chips production technology. Consideration should be given to the influence of various debarking parameters when processing wood in barking drums. Such parameters as the number of wood collisions with each other and against a drum body, shear pressure, and others were chosen as equation coefficients to model the wood debarking time and knife sharpening angle. The treatment time is shown to depend on the number of collisions, the diameter of the log and indices that consider filling, the proportion of bark and the thickness, and wood hardness. It was established that the time required to debark the tree using knives is 1.5-3 times lower depending on the temperature of raw materials. Moreover, the process tends to be intensified with increasing knife sharpness.

The Erd\H{o}s-Simonovits stability theorem states that for all \epsilon >0 there exists \alpha >0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - \alpha n^2, then one can remove \epsilon n^2 edges from G to obtain an r-partite graph. F\"uredi gave a short proof that one can choose \alpha=\epsilon. We give a bound for the relationship of \alpha and \varepsilon which is asymptotically sharp as \epsilon \to 0., Comment: 12 pages, 1 figure

An ordered graph is a simple graph with an ordering on its vertices. Define the ordered path P n to be the monotone increasing path with n edges. The ordered size Ramsey number r ( P r , P s ) is the minimum number m for which there exists an ordered graph H with m edges such that every two-coloring of the edges of H contains a red copy of P r or a blue copy of P s . For 2 ≤ r ≤ s , we show 1 8 r 2 s ≤ r ( P r , P s ) ≤ C r 2 s ( log s ) 3 , where C > 0 is an absolute constant. This problem is motivated by the recent results of Bucic et al. (2019) and Letzter and Sudakov (2019) for oriented graphs.

A hypergraph $\mathcal H$ is super-pancyclic if for each $A \subseteq V(\mathcal H)$ with $|A| \geq 3$, $\mathcal H$ contains a Berge cycle with base vertex set $A$. We present two natural necessary conditions for a hypergraph to be super-pancyclic, and show that in several classes of hypergraphs these necessary conditions are also sufficient for this. In particular, they are sufficient for every hypergraph $\mathcal H$ with $ \delta(\mathcal H)\geq \max\{|V(\mathcal H)|, \frac{|E(\mathcal H)|+10}{4}\}$. We also consider super-cyclic bipartite graphs: those are $(X,Y)$-bigraphs $G$ such that for each $A \subseteq X$ with $|A| \geq 3$, $G$ has a cycle $C_A$ such that $V(C_A)\cap X=A$. Such graphs are incidence graphs of super-pancyclic hypergraphs, and our proofs use the language of such graphs., Comment: 17 pages

We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graph $K_{n_1,\ldots,n_s}$ there exists a monochromatic (i) cycle $C_{2n}$ with $2n$ vertices, (ii) cycle $C_{\geq 2n}$ with at least $2n$ vertices, (iii) path $P_{2n}$ with $2n$ vertices, and (iv) path $P_{2n+1}$ with $2n+1$ vertices. This implies a generalization for large $n$ of the conjecture by Gy\'arf\'as, Ruszink\'o, S\'ark\H{o}zy and Szemer\'edi that for every $2$-edge-coloring of the complete $3$-partite graph $K_{n,n,n}$ there is a monochromatic path $P_{2n+1}$. An important tool is our recent stability theorem on monochromatic connected matchings., Comment: 46 pages, 4 figures

An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in an $\epsilon$-distance-uniform graph with $n$ vertices. We show that for $\frac1n \le \epsilon \le \frac1{\log n}$, there exist $\epsilon$-distance-uniform graphs with critical distance $2^{\Omega(\frac{\log n}{\log \epsilon^{-1}})}$, disproving a conjecture of Alon et al. that $d$ can be at most logarithmic in $n$. We also show that our construction is best possible, in the sense that an upper bound on $d$ of the form $2^{O(\frac{\log n}{\log \epsilon^{-1}})}$ holds for all $\epsilon$ and $n$., Comment: 12 pages, 1 figure

The Van der Waerden number $W(k,r)$ denotes the smallest $n$ such that whenever $[n]$ is $r$–colored there exists a monochromatic arithmetic progression of length $k$. Similarly, the Hilbert cube number $h(k,r)$ denotes the smallest $n$ such that whenever $[n]$ is $r$–colored there exists a monochromatic affine $k$–cube, that is, a set of the form$$\left\{x_0 + \sum_{b \in B} b : B \subseteq A\right\}$$ for some $|A|=k$ and $x_0 \in \mathbb{Z}$. We show the following relation between the Hilbert cube number and the Van der Waerden number. Let $k \geqslant 3$ be an integer. Then for every $\epsilon >0$, there is a $c > 0$ such that $$h(k,4) \geqslant \min\{W(\lfloor c k^2\rfloor, 2), 2^{k^{2.5-\epsilon}}\}.$$ Thus we improve upon state of the art lower bounds for $h(k,4)$ conditional on $W(k,2)$ being significantly larger than $2^k$. In the other direction, this shows that if the Hilbert cube number is close to its state of the art lower bounds, then $W(k,2)$ is at most doubly exponential in $k$. We also show the optimal result that for any Sidon set $A \subset \mathbb{Z}$, one has $$\left|\left\{\sum_{b \in B} b : B \subseteq A\right\}\right| = \Omega( |A|^3) .$$

In Graham and Rothschild (1971), Graham and Rothschild consider a geometric Ramsey problem: finding the least N ∗ such that if all edges of the complete graph on the points { ± 1 } N ∗ are 2 -colored, there exist 4 coplanar points such that the 6 edges between them are monochromatic. They give an explicit upper bound: N ∗ ≤ F ( F ( F ( F ( F ( F ( F ( 12 , 3 ) , 3 ) , 3 ) , 3 ) , 3 ) , 3 ) , 3 ) , where F ( m , n ) = 2 ↑ m n , an extremely fast-growing function. We bound N ∗ between two instances of a variant of the Hales–Jewett problem, obtaining an upper bound which is less than 2 ↑ ↑ ↑ 6 = F ( 3 , 6 ) .

Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of $G$ are colored. The game chromatic number \chi_g(G) is the minimum k for which the first player has a winning strategy. The paper \cite{BFS} began the analysis of the asymptotic behavior of this parameter for a random graph G_{n,p}. This paper provides some further analysis for graphs with constant average degree i.e. np=O(1) and for random regular graphs., Comment: Correction

For Legendrian links in the 1-jet space of $S^1$ we show that the 1-graded ruling polynomial may be recovered from the Kauffman skein module. For such links a generalization of the notion of normal ruling is introduced. We show that the existence of such a generalized normal ruling is equivalent to sharpness of the Kauffman polynomial estimate for the Thurston-Bennequin number as well as to the existence of an ungraded augmentation of the Chekanov-Eliashberg DGA. Parallel results involving the HOMFLY-PT polynomial and 2-graded generalized normal rulings are established., Comment: 26 pages, 6 figures

Human observers are able to identify a person based on his or her gait. However, little is known about the underlying mechanisms and the kind of information used to accomplish such a task. In this study, participants learned to discriminate seven male walkers shown as point-light displays from frontal, half-profile, or profile view. The displays were gradually normalized with respect to size, shape, and walking frequency, and identification performance was measured. All observers quickly learned to discriminate the walkers, but there was an overall advantage in favor of the frontal view. No effect of size normalization was found, but performance deteriorated when shape or walking frequency was normalized. Presenting the walkers from novel viewpoints resulted in a further decrease in performance. However, even after applying all normalization steps and rotating the walker by 90 degrees, recognition performance was still nearly three times higher than chance level.

In [On the HOMFLY-PT skein module of S1 × S2, Math. Z. 237(4) (2001) 769–814], Gilmer and Zhong established the existence of an invariant for links in S1 × S2 which is a rational function in variables a and s and satisfies the HOMFLY-PT skein relations. We give formulas for evaluating this invariant in terms of a standard, geometrically simple basis for the HOMFLY-PT skein module of the solid torus. This allows computation of the invariant for arbitrary links in S1 × S2 and shows that the invariant is in fact a Laurent polynomial in a and z = s – s-1. Our proof uses connections between HOMFLY-PT skein modules and invariants of Legendrian links. As a corollary, we extend HOMFLY-PT polynomial estimates for the Thurston–Bennequin number to Legendrian links in S1 × S2 with its tight contact structure.