相关论文: Periods of a max-type equation

We prove that if f is a self-map of an algebraic variety over a field K, then under certain conditions on X, f and K the set of possible periods of K-valued periodic points of f is finite.

Let $S=\langle a_1,\ldots,a_p\rangle$ be a numerical semigroup, $s\in S$ and ${\sf z}(s)$ its set of factorizations. The set of length is denoted by ${\mathcal L}(s)=\{{\tt L}(x_1,\dots,x_p)\mid (x_1,\dots,x_p)\in{\sf Z}(s)\}$ where ${\tt…

Given an edge-weighted graph $G$ on $n$ nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximized. We propose a fixed-parameter tractable algorithm…

We prove that if $\max\{|a_0|,|a_1|\}\le 10$ and $\lambda\in\ ]-2,2[$, then the sequence defined by $$ 0 \le a_{n+2} +\lambda a_{n+1}+a_n<1 $$ is periodic.

For a set of matroids $\mathcal{M}$, let $ex_\mathcal{M}(n)$ be the maximum size of a simple rank-$n$ matroid in $\mathcal{M}$. We prove that, for any finite field $\mathbb{F}$, if $\mathcal{M}$ is a minor-closed class of…

In this paper, we find regular or biregular Hadamard matrices with maximum excess by negating some rows and columns of known Hadamard matrices obtained from quadratic residues of finite fields. In particular, we show that if either…

Max-plus equations are derived from tropically discretized Sel'kov model via ultradiscretization. These max-plus equations possess common dynamical structures with the discretized model: Neimark-Sacker bifurcation and limit cycles. The…

We revisit a well-known divide-and-conquer maximin recurrence $f(n) = \max(\min(n_1,n_2) + f(n_1) + f(n_2))$ where the maximum is taken over all proper bipartitions $n = n_1+n_2$, and we present a new characterization of the pairs…

We consider the set $$\mathcal{A} = \left\{10\cdot a + 11\cdot b \ | \gcd(a,b)=1, a\geq 1, b\geq 2a+1 \right\}.$$ We will prove that $\mathcal{A}$ is unbounded and that there exists a natural number $M\notin \mathcal{A}$ for which…

Consider the set $[m]\times [n] = \{(i,j)\, : 1\le i \le m, 1\le j \le n\}$ and the equation $x_1+x_2 = x_3$, namely $eq$. The \emph{rainbow number of $[m] \times [n]$ for $eq$}, denoted $\text{rb}([m]\times [n],eq)$, is the smallest number…

We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the Edwards-Erd\H{o}s bound is fixed-parameter tractable: we give an algorithm that for any connected graph with n vertices…

We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being…

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

We prove a necessary and sufficient condition for the existence of a $T$-periodic solution for the time-periodic second order differential equation $\ddot{x}+f(t,x)+p(t,x,\dot x)=0$, where $f$ grows superlinearly in $x$ uniformly in time,…

This paper presents a formula for $a$-number of certain maximal curves characterized by the equation $y^{\frac{q+1}{2}} = x^m + x$ over the finite field $\mathbb{F}_{q^2}$. $a$-number serves as an invariant for the isomorphism class of the…

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

The main result of this paper is the following: if F is any field and R is any F-subalgebra of the algebra of nxn matrices over F with Lie nilpotence index m, then the F-dimension of R is less or equal than M(m+1,n), where M(m+1,n) is the…